AUSAI
2010
Springer
13 years 10 months ago
2010
Springer
Abstract. Planning-specific heuristics for SAT have recently been shown to produce planners that match best earlier ones that use other search methods, including the until now dom...
WADS
2001
Springer
14 years 3 months ago
2001
Springer
Even though a large number of I/O-efficient graph algorithms have been developed, a number of fundamental problems still remain open. For example, no space- and I/O-efficient algo...
HIPC
2005
Springer
14 years 5 months ago
2005
Springer
A snap-stabilizing protocol, starting from any configuration, always behaves according to its specification. In this paper, we present a snap-stabilizing protocol which detects ...