Sciweavers

3220 search results - page 491 / 644
» Constrained Graph Processes
Sort
View
ICRA
2009
IEEE
188views Robotics» more  ICRA 2009»
16 years 1 months ago
Potential field guide for humanoid multicontacts acyclic motion planning
Abstract—We present a motion planning algorithm that computes rough trajectories used by a contact-points planner as a guide to grow its search graph. We adapt collision-free mot...
Karim Bouyarmane, Adrien Escande, Florent Lamiraux...
ADC
2009
Springer
147views Database» more  ADC 2009»
16 years 1 months ago
The Effect of Sparsity on Collaborative Filtering Metrics
This paper presents a detailed study of the behavior of three different content-based collaborative filtering metrics (correlation, cosine and mean squared difference) when they a...
Jesús Bobadilla, Francisco Serradilla
GECCO
2009
Springer
200views Optimization» more  GECCO 2009»
16 years 1 months ago
Apply ant colony optimization to Tetris
Tetris is a falling block game where the player’s objective is to arrange a sequence of different shaped tetrominoes smoothly in order to survive. In the intelligence games, ag...
Xingguo Chen, Hao Wang, Weiwei Wang, Yinghuan Shi,...
CSMR
2008
IEEE
16 years 1 months ago
SOLIDFX: An Integrated Reverse Engineering Environment for C++
Many C++ extractors exist that produce syntax trees, call graphs, and metrics from C++ code, yet few offer integrated querying, navigation, and visualization of sourcecode-level f...
Alexandru Telea, Lucian Voinea
ICDCS
2008
IEEE
16 years 1 months ago
On the Longest RNG Edge of Wireless Ad Hoc Networks
— Relative neighborhood graph (RNG) has been widely used in topology control and geographic routing in wireless ad hoc networks. Its maximum edge length is the minimum requiremen...
Peng-Jun Wan, Lixin Wang, F. Frances Yao, Chih-Wei...