389 search results - page 15 / 78 » Some natural decision problems in automatic graphs |
AIPS
2008
13 years 9 months ago
2008
The current evaluation functions for heuristic planning are expensive to compute. In numerous domains these functions give good guidance on the solution, so it worths the computat...
SAC
2009
ACM
14 years 2 months ago
2009
ACM
The molecular distance geometry problem can be formulated as the problem of finding an immersion in R3 of a given undirected, nonnegatively weighted graph G. In this paper, we di...
PODC
1999
ACM
13 years 11 months ago
1999
ACM
We present a combinatorial framework for the study of a natural class of distributed optimization problems that involve decisionmaking by a collection of n distributed agents in th...
LOPSTR
2004
Springer
14 years 22 days ago
2004
Springer
For use in earlier approaches to automated module interface adaptation, we seek a restricted form of program synthesis. Given some typing assumptions and a desired result type, we ...
ISAAC
2003
Springer
14 years 17 days ago
2003
Springer
Abstract. We define an algorithm for determining, in a linear number of symbolic steps, the biconnected components of a graph implicitly represented with Ordered Binary Decision D...