292 search results - page 27 / 59 » Are Stable Instances Easy |
110
Voted
IJCAI
2003
15 years 2 months ago
2003
We empirically study phase transitions of the asymmetric Traveling Salesman. Using random instances of up to 1,500 cities, we show that many properties of the problem, including t...
AAAI
2000
15 years 2 months ago
2000
Equivalency clauses (Xors or modulo 2 arithmetics) represent a common structure in the SAT-encoding of many hard real-world problems and constitute a major obstacle to DavisPutnam...
114
Voted
PDPTA
2000
15 years 2 months ago
2000
Internet-based clusters of workstations have been extensively used to execute parallel applications. Although these internet-based clusters seem to be an easy and inexpensive way ...
117
Voted
DAGSTUHL
1994
15 years 2 months ago
1994
A strategy for working with incomplete information is called competitive if it solves each problem instance at a cost not exceeding the cost of an optimal solution (with full info...
ATAL
2010
Springer
15 years 1 months ago
2010
Springer
A multi-agent VRP solver is presented in this paper. It utilizes the contract-net protocol based allocation and several improvement strategies. It provides the solution with the q...