Sciweavers

1016 search results - page 81 / 204
» Optimized algorithms for multi-agent routing
Sort
View
IPPS
1998
IEEE
15 years 2 months ago
Lower Bounds on Communication Loads and Optimal Placements in Torus Networks
Fully-populated tori, where every node has a processor attached, do not scale well since load on edges increases superlinearly with network size under heavy communication, resulti...
M. Cemil Azizoglu, Ömer Egecioglu
ATMOS
2009
130views Optimization» more  ATMOS 2009»
14 years 11 months ago
Arc-Flags in Dynamic Graphs
Abstract. Computation of quickest paths has undergoing a rapid development in recent years. It turns out that many high-performance route planning algorithms are made up of several...
Emanuele Berrettini, Gianlorenzo D'Angelo, Daniel ...
ICRA
2010
IEEE
128views Robotics» more  ICRA 2010»
14 years 8 months ago
On optimal AUV track-spacing for underwater mine detection
— This work addresses the task of designing the optimal survey route that an autonomous underwater vehicle (AUV) should take in mine countermeasures (MCM) operations. It is assum...
David P. Williams
HM
2007
Springer
180views Optimization» more  HM 2007»
15 years 1 months ago
Empirical Analysis of Two Different Metaheuristics for Real-World Vehicle Routing Problems
We present two hybrid Metaheuristics, a hybrid Iterated Local Search and a hybrid Simulated Annealing, for solving real-world extensions of the Vehicle Routing Problem with Time Wi...
Tonci Caric, Juraj Fosin, Ante Galic, Hrvoje Gold,...
FCCM
2005
IEEE
139views VLSI» more  FCCM 2005»
15 years 3 months ago
A Study of the Scalability of On-Chip Routing for Just-in-Time FPGA Compilation
Just-in-time (JIT) compilation has been used in many applications to enable standard software binaries to execute on different underlying processor architectures. We previously in...
Roman L. Lysecky, Frank Vahid, Sheldon X.-D. Tan