Sciweavers

2313 search results - page 3 / 463
» On Heuristic Time Hierarchies
Sort
View
UMC
2000
14 years 1 months ago
Upper and Lower Bounds on Continuous-Time Computation
Abstract. We consider various extensions and modifications of Shannon's General Purpose Analog Computer, which is a model of computation by differential equations in continuou...
Manuel Lameiras Campagnolo, Cristopher Moore
AIPS
2008
14 years 3 days ago
Unifying the Causal Graph and Additive Heuristics
Many current heuristics for domain-independent planning, such as Bonet and Geffner's additive heuristic and Hoffmann and Nebel's FF heuristic, are based on delete relaxa...
Malte Helmert, Hector Geffner
ICALP
2005
Springer
14 years 3 months ago
Time-Space Lower Bounds for the Polynomial-Time Hierarchy on Randomized Machines
We establish the first polynomial-strength time-space lower bounds for problems in the lineartime hierarchy on randomized machines with two-sided error. We show that for any inte...
Scott Diehl, Dieter van Melkebeek
APLAS
2008
ACM
13 years 11 months ago
Game Characterizations of Process Equivalences
In this paper we propose a hierarchy of games that allows us to make a systematic comparison of process equivalences by characterizing process equivalences as games. The well-known...
Xin Chen, Yuxin Deng
AAAI
2008
14 years 3 days ago
On the Power of Top-Down Branching Heuristics
We study the relative best-case performance of DPLL-based structure-aware SAT solvers in terms of the power of the underlying proof systems. The systems result from (i) varying th...
Matti Järvisalo, Tommi A. Junttila