599 search results - page 23 / 120 » The traveling salesman problem |
74
Voted
HPCC
2005
Springer
15 years 6 months ago
2005
Springer
By the use of the GRIBB software for distributed computing across the Internet, we are investigating the obstacles and the potential for efficient parallelization of Branch and Bou...
102
Voted
TCS
2008
15 years 12 days ago
2008
We study the usefulness of lookahead in online server routing problems: if an online algorithm is not only informed about the requests released so far, but also has a limited abil...
111
Voted
CEC
2003
IEEE
15 years 5 months ago
2003
IEEE
Abstract- Simulated annealing (SA) is an effective general heuristic method for solving many combinatorial optimization problems. This paper deals with two problems in SA. One is ...
101
Voted
IPPS
2002
IEEE
15 years 5 months ago
2002
IEEE
We introduce a new method to estimate the Java object activity in a distributed context of irregular applications. This method uses an observation mechanism which is itself a part...
99
Voted
APNOMS
2006
Springer
15 years 4 months ago
2006
Springer
This paper shows that geographic information system can successfully solve TSP (travelling salesman problem). It has been done using a module of the designed and implemented by aut...