Sciweavers

741 search results - page 109 / 149
» Robust Constraint Solving Using Multiple Heuristics
Sort
View
CVPR
2011
IEEE
14 years 9 months ago
Learning Temporally Consistent Rigidities
We present a novel probabilistic framework for rigid tracking and segmentation of shapes observed from multiple cameras. Most existing methods have focused on solving each of thes...
Jean-Sebastien Franco, Edmond Boyer
AR
2007
138views more  AR 2007»
15 years 2 months ago
Integrating robotics and neuroscience: brains for robots, bodies for brains
—Researchers in robotics and artificial intelligence have often looked at biology as a source of inspiration for solving their problems. From the opposite perspective, neuroscie...
Michele Rucci, Daniel Bullock, Fabrizio Santini
GECCO
2000
Springer
168views Optimization» more  GECCO 2000»
15 years 5 months ago
A Fault-tolerant Multicast Routing Algorithm in ATM Networks
This paper presents a genetic algorithm based method to solve the capacity and routing assignment problem arising in the design of selfhealing networks using the Virtual Path (VP)...
Sam Kwong, S. S. Chan
CVPR
2004
IEEE
16 years 4 months ago
Efficient Search of Faces from Complex Line Drawings
Single 2D line drawing is a straightforward method to illustrate 3D objects. The faces of an object depicted by a line drawing give very useful information for the reconstruction ...
Jianzhuang Liu, Xiaoou Tang
GECCO
2009
Springer
107views Optimization» more  GECCO 2009»
15 years 8 months ago
Swarming along the evolutionary branches sheds light on genome rearrangement scenarios
A genome rearrangement scenario describes a series of chromosome fusion, fission, and translocation operations that suffice to rewrite one genome into another. Exact algorithmic ...
Nikolay Vyahhi, Adrien Goëffon, Macha Nikolsk...