613 search results - page 65 / 123 » Generalized Traveling Salesman Problem Reduction Algorithms |
AAAI
1997
13 years 9 months ago
1997
We show that a resealed constrainedness parameter provides the basis for accurate numerical models of search cost for both backtracking and local search algorithms. In the past, t...
KDD
2009
ACM
14 years 8 months ago
2009
ACM
We present an algorithm, called the offset tree, for learning in situations where a loss associated with different decisions is not known, but was randomly probed. The algorithm i...
FOCS
1993
IEEE
13 years 11 months ago
1993
IEEE
We consider the following scenario. A point robot is placed at some start location ¡ in a 2dimensional scene containing oriented rectangular obstacles. The robot must repeatedly ...
WDAG
2007
Springer
14 years 1 months ago
2007
Springer
A group of identical mobile agents moving asynchronously among the nodes of an anonymous network have to gather together in a single node of the graph. This problem known as the (a...
FOCS
2009
IEEE
14 years 2 months ago
2009
IEEE
— We study the complexity of a class of problems involving satisfying constraints which remain the same under translations in one or more spatial directions. In this paper, we sh...