1197 search results - page 129 / 240 » Which Dynamic Constraint Problems Can Be Solved By Ants |
CPHYSICS
2006
13 years 8 months ago
2006
The WATERWAVES program suite performs complex scattering calculations by propagating a wave packet in a complex, full-dimensional potential for non-rotating (J = 0) but vibrating ...
NIPS
2003
13 years 9 months ago
2003
Online mechanism design (MD) considers the problem of providing incentives to implement desired system-wide outcomes in systems with self-interested agents that arrive and depart ...
ICCV
2007
IEEE
14 years 2 months ago
2007
IEEE
The matching of planar shapes can be cast as a problem of finding the shortest path through a graph spanned by the two shapes, where the nodes of the graph encode the local simil...
IJRR
2011
13 years 3 months ago
2011
This paper presents a novel method for online and incremental appearance-based localization and mapping in a highly dynamic environment. Using position-invariant robust features (...
KES
1999
Springer
14 years 15 days ago
1999
Springer
—Genetic Algorithms (GAs) are powerful search techniques that are used to solve difficult problems in many disciplines. Unfortunately, they can be very demanding in terms of com...