1197 search results - page 45 / 240 » Which Dynamic Constraint Problems Can Be Solved By Ants |
161
click to vote
COR
2007
15 years 5 months ago
2007
This paper presents several Arcs-States models that can be applied to numerous vehicle routing problems, one of which is the well-known vehicle routing problem with capacities and...
154
click to vote
ATAL
2010
Springer
15 years 6 months ago
2010
Springer
Service coordination in domains involving temporal constraints and duration uncertainty has previously been solved with a greedy algorithm that attempts to satisfy service requests...
152
click to vote
CEC
2010
IEEE
15 years 6 months ago
2010
IEEE
This paper presents an adaptation of a novel algorithm based on the foraging behavior of honey bees to solve constrained numerical optimization problems. The modifications focus on...
133
click to vote
ICASSP
2009
IEEE
15 years 9 months ago
2009
IEEE
In this paper, we solve the problem of detecting the entries of a sparse finite-alphabet signal from a limited amount of data, for instance obtained by compressive sampling. While...
167
click to vote
PVLDB
2010
15 years 4 months ago
2010
The current widespread use of location-based services and GPS technologies has revived interest in very fast and scalable shortest path queries. We introduce a new shortest path q...