Sciweavers

2430 search results - page 406 / 486
» Computing Tutte Polynomials
Sort
View
131
Voted
AAAI
2006
15 years 4 months ago
Learning Partially Observable Action Schemas
We present an algorithm that derives actions' effects and preconditions in partially observable, relational domains. Our algorithm has two unique features: an expressive rela...
Dafna Shahaf, Eyal Amir
116
Voted
DLT
2003
15 years 4 months ago
NFA Reduction Algorithms by Means of Regular Inequalities
We present different techniques for reducing the number of states and transitions in nondeterministic automata. These techniques are based on the two preorders over the set of st...
Jean-Marc Champarnaud, Fabien Coulon
SODA
2004
ACM
115views Algorithms» more  SODA 2004»
15 years 4 months ago
Minimizing the stabbing number of matchings, trees, and triangulations
The (axis-parallel) stabbing number of a given set of line segments is the maximum number of segments that can be intersected by any one (axis-parallel) line. We investigate probl...
Sándor P. Fekete, Marco E. Lübbecke, H...
124
Voted
AIPS
2000
15 years 4 months ago
Admissible Heuristics for Optimal Planning
hsp and hspr are two recent planners that search the state-space using an heuristic function extracted from Strips encodings. hsp does a forward search from the initial state reco...
Patrik Haslum, Hector Geffner
133
Voted
AAAI
1996
15 years 4 months ago
A Connectionist Framework for Reasoning: Reasoning with Examples
We present a connectionist architecture that supports almost instantaneous deductive and abductive reasoning. The deduction algorithm responds in few steps for single rule queries...
Dan Roth