Sciweavers

2902 search results - page 246 / 581
» Simple Local Models for Complex Dynamical Systems
Sort
View
GECCO
2006
Springer
157views Optimization» more  GECCO 2006»
15 years 7 months ago
How randomized search heuristics find maximum cliques in planar graphs
Surprisingly, general search heuristics often solve combinatorial problems quite sufficiently, although they do not outperform specialized algorithms. Here, the behavior of simple...
Tobias Storch
IVC
2006
248views more  IVC 2006»
15 years 4 months ago
Appearance models for occlusion handling
Objects in the world exhibit complex interactions. When captured in a video sequence, some interactions manifest themselves as occlusions. A visual tracking system must be able to...
Andrew W. Senior, Arun Hampapur, Ying-li Tian, Lis...
PPSN
1992
Springer
15 years 8 months ago
Hyperplane Annealing and Activator-Inhibitor-Systems
This paper introduces a new optimization technique called hyperplane annealing. It is similar to the mean field annealing approach to combinatorial optimization. Both annealing te...
Thomas Laußermair
ATAL
2004
Springer
15 years 9 months ago
Accurate and Flexible Simulation for Dynamic, Vision-Centric Robot
As robots become more complex by incorporating dynamic stability or greater mechanical degrees of freedom, the difficulty of developing control algorithms directly on the robot in...
Jared Go, Brett Browning, Manuela M. Veloso
ATAL
2008
Springer
15 years 6 months ago
Evaluating the performance of DCOP algorithms in a real world, dynamic problem
Complete algorithms have been proposed to solve problems modelled as distributed constraint optimization (DCOP). However, there are only few attempts to address real world scenari...
Robert Junges, Ana L. C. Bazzan