1197 search results - page 58 / 240 » Which Dynamic Constraint Problems Can Be Solved By Ants |
NECO
1998
13 years 9 months ago
1998
three different levels of abstraction: detailed models including ctivity dynamics, weight dynamics that abstract from the neural activity dynamics by an adiabatic approximation, an...
IWPEC
2004
Springer
14 years 2 months ago
2004
Springer
We propose to look at the computational complexity of 2-dimensional geometric optimization problems on a finite point set with respect to the number of inner points (that is, poi...
SWARM
2010
SPRINGER
13 years 7 months ago
2010
SPRINGER
In the past few years there has been a lot of research on the application of swarm intelligence to the problem of adaptive routing in telecommunications networks. A large number of...
CPAIOR
2009
Springer
14 years 3 months ago
2009
Springer
Context-free grammar constraints enforce that a sequence of variables forms a word in a language defined by a context-free grammar. The constraint has received a lot of attention ...
ICRA
2009
IEEE
14 years 4 months ago
2009
IEEE
— Rapidly-exploring Random Trees (RRTs) are widely used to solve large planning problems where the scope prohibits the feasibility of deterministic solvers, but the efficiency o...