866 search results - page 118 / 174 » On Dynamic Shortest Paths Problems |
65
Voted
GECCO
2003
Springer
15 years 3 months ago
2003
Springer
We explore the advantages of DNA-like genomes for evolutionary computation in silico. Coupled with simulations of chemical reactions, these genomes offer greater efficiency, reliab...
ICRA
2007
IEEE
15 years 4 months ago
2007
IEEE
— We consider the problem of generating global feasible trajectories for nonholonomic mobile robots in the presence of moving obstacles. The global trajectory is composed of regi...
HIPC
2003
Springer
15 years 3 months ago
2003
Springer
Delay and jitter management in high performance active computation is a challenging problem in the emerging area of internet computing. The problem takes a complex new form from it...
CLUSTER
2004
IEEE
15 years 1 months ago
2004
IEEE
Cluster Storage Systems where storage devices are distributed across a large number of nodes are able to reduce the I/O bottleneck problems present in most centralized storage sys...
COLT
2004
Springer
15 years 3 months ago
2004
Springer
We give an algorithm for the bandit version of a very general online optimization problem considered by Kalai and Vempala [1], for the case of an adaptive adversary. In this proble...