Sciweavers

4313 search results - page 18 / 863
» Using time travel to diagnose computer problems
Sort
View
SASO
2007
IEEE
15 years 4 months ago
On Scaling Multi-Agent Task Reallocation Using Market-Based Approach
Multi-agent systems (MAS) provide a promising technology for addressing problems such as search and rescue missions, mine sweeping, and surveillance. These problems are a form of ...
Rajesh K. Karmani, Timo Latvala, Gul Agha
COR
2007
183views more  COR 2007»
14 years 9 months ago
Arcs-states models for the vehicle routing problem with time windows and related problems
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...
Thierry Mautor, Edith Naudin
LION
2009
Springer
210views Optimization» more  LION 2009»
15 years 4 months ago
Beam-ACO Based on Stochastic Sampling: A Case Study on the TSP with Time Windows
Beam-ACO algorithms are hybrid methods that combine the metaheuristic ant colony optimization with beam search. They heavily rely on accurate and computationally inexpensive boundi...
Manuel López-Ibáñez, Christia...
SSIAI
2002
IEEE
15 years 2 months ago
Automated Detection of All Kinds of Violations at a Street Intersection Using Real Time Individual Vehicle Tracking
2. Tracking traveling trajectory The traveling trajectory of eachvehicle is evaluatedfrom the analog images of 30 frames/sec.The computation of a traveling trajectory is mainly di...
Dae-Woon Lim, Sung-Hoon Choi, Joon-Suk Jun
IPPS
2005
IEEE
15 years 3 months ago
A Distributed Chained Lin-Kernighan Algorithm for TSP Problems
The Chained Lin-Kernighan algorithm (CLK) is one of the best heuristics to solve Traveling Salesman Problems (TSP). In this paper a distributed algorithm is proposed, were nodes i...
Thomas Fischer, Peter Merz