Sciweavers

3333 search results - page 30 / 667
» Abstract Proof Search
Sort
View
AIPS
2006
13 years 11 months ago
Friends or Foes? An AI Planning Perspective on Abstraction and Search
Jörg Hoffmann, Ashish Sabharwal, Carmel Domsh...
AAAI
1996
13 years 11 months ago
Hierarchical A*: Searching Abstraction Hierarchies Efficiently
Robert C. Holte, M. B. Perez, Robert M. Zimmer, Al...
JAIR
2007
77views more  JAIR 2007»
13 years 9 months ago
Graph Abstraction in Real-time Heuristic Search
Vadim Bulitko, Nathan R. Sturtevant, Jieshan Lu, T...
TLCA
2009
Springer
14 years 4 months ago
Syntax for Free: Representing Syntax with Binding Using Parametricity
We show that, in a parametric model of polymorphism, the type ∀α.((α → α) → α) → (α → α → α) → α is isomorphic to closed n terms. That is, the type of closed ...
Robert Atkey
MOR
2007
99views more  MOR 2007»
13 years 9 months ago
Stochastic Search in a Forest Revisited
We consider a generalization of the model of stochastic search in an out-forest, introduced and studied by Denardo, Rothblum, and Van der Heyden [1]. We provide a simple proof of ...
Jay Sethuraman, John N. Tsitsiklis