1578 search results - page 187 / 316 » Algorithmic randomness of continuous functions |
ICPPW
2006
IEEE
14 years 2 months ago
2006
IEEE
Homotopy methods to solve polynomial systems are well suited for parallel computing because the solution paths defined by the homotopy can be tracked independently. For sparse po...
GECCO
2003
Springer
14 years 2 months ago
2003
Springer
The capability of multi-objective evolutionary algorithms (MOEAs) to handle premature convergence is critically important when applied to real-world problems. Their highly multi-mo...
ICRA
2002
IEEE
14 years 1 months ago
2002
IEEE
We present motion planning for dexterous manipulation by whole arm grasp system based on switching contact modes. Motion planning for such a system should consider changing dynami...
ACCV
2010
Springer
13 years 4 months ago
2010
Springer
Abstract. Robust foreground object segmentation via background modelling is a difficult problem in cluttered environments, where obtaining a clear view of the background to model i...
CDC
2010
IEEE
13 years 3 months ago
2010
IEEE
Consensus algorithms provide an elegant distributed way for computing the average of a set of measurements across a sensor network. However, the convergence of the node estimates t...