Sciweavers

20441 search results - page 272 / 4089
» Locally Computable Structures
Sort
View
ICPR
2006
IEEE
16 years 5 months ago
Part-Based Probabilistic Point Matching
Correspondence algorithms typically struggle with shapes that display part-based variation. We present a probabilistic approach that matches shapes using independent part transfor...
Graham McNeill, Sethu Vijayakumar
CEC
2005
IEEE
15 years 10 months ago
Music evolution in a complex system of interacting agents
The evolution of music, from random note strings to certain “pleasant” note sequences, is traced in a multi-agent computational model. A community of agents, with some musical ...
Tao Gong, Qian Zhang, Hua Wu
BMVC
2002
15 years 7 months ago
Adaptive Learning of Statistical Appearance Models for 3D Human Tracking
A likelihood formulation for human tracking is presented based upon matching feature statistics on the surface of an articulated 3D body model. A benefit of such a formulation ove...
Timothy J. Roberts, Stephen J. McKenna, Ian W. Ric...
GECCO
2004
Springer
119views Optimization» more  GECCO 2004»
15 years 10 months ago
Randomized Local Search, Evolutionary Algorithms, and the Minimum Spanning Tree Problem
Randomized search heuristics, among them randomized local search and evolutionary algorithms, are applied to problems whose structure is not well understood, as well as to problems...
Frank Neumann, Ingo Wegener
IJCAI
2001
15 years 5 months ago
Local Search Topology in Planning Benchmarks: An Empirical Analysis
Many state-of-the-art heuristic planners derive their heuristic function by relaxing the planning task at hand, where the relaxation is to assume that all delete lists are empty. ...
Jörg Hoffmann