Sciweavers

1172 search results - page 212 / 235
» Path Algorithms on Regular Graphs
Sort
View
AAAI
2007
13 years 12 months ago
Conservative Dual Consistency
Consistencies are properties of Constraint Networks (CNs) that can be exploited in order to make inferences. When a significant amount of such inferences can be performed, CNs ar...
Christophe Lecoutre, Stéphane Cardon, Julie...
IJHPCA
2006
125views more  IJHPCA 2006»
13 years 9 months ago
Complexity Results for Collective Communications on Heterogeneous Platforms
In this paper, we consider the communications involved in the execution of a complex application, deployed on a heterogeneous platform. Such applications extensively use macro-com...
Olivier Beaumont, Loris Marchal, Yves Robert
ALGORITHMICA
2002
84views more  ALGORITHMICA 2002»
13 years 9 months ago
Exploring Unknown Environments with Obstacles
We study exploration problems where a robot has to construct a complete map of an unknown environment using a path that is as short as possible. In the rst problem setting we cons...
Susanne Albers, Klaus Kursawe, Sven Schuierer
IPL
2002
118views more  IPL 2002»
13 years 9 months ago
Differential approximation results for the traveling salesman and related problems
This paper deals with the problem of constructing a Hamiltonian cycle of optimal weight, called TSP. We show that TSP is 2/3-differential approximable and can not be differential a...
Jérôme Monnot
ESA
2004
Springer
129views Algorithms» more  ESA 2004»
14 years 3 months ago
Contraction and Treewidth Lower Bounds
Edge contraction is shown to be a useful mechanism to improve lower bound heuristics for treewidth. A successful lower bound for treewidth is the degeneracy: the maximum over all ...
Hans L. Bodlaender, Arie M. C. A. Koster, Thomas W...