Sciweavers

734 search results - page 1 / 147
» Narrowing the Narrowing Space
Sort
View
PLILP
1997
Springer
13 years 9 months ago
Narrowing the Narrowing Space
We introduce a framework for managing as a whole the space of a narrowing computation. The aim of our framework is to find a finite representation of an infinite narrowing space...
Sergio Antoy, Zena M. Ariola
FLOPS
1999
Springer
13 years 9 months ago
Typed Higher-Order Narrowing without Higher-Order Strategies
We describe a new approach to higher-order narrowing computations in a class of systems suitable for functional logic programming. Our approach is based on a translation of these s...
Sergio Antoy, Andrew P. Tolmach
STOC
2006
ACM
121views Algorithms» more  STOC 2006»
14 years 5 months ago
Narrow proofs may be spacious: separating space and width in resolution
The width of a resolution proof is the maximal number of literals in any clause of the proof. The space of a proof is the maximal number of clauses kept in memory simultaneously if...
Jakob Nordström
ICRA
2003
IEEE
127views Robotics» more  ICRA 2003»
13 years 10 months ago
The bridge test for sampling narrow passages with probabilistic roadmap planners
Probabilistic roadmap (PRM) planners have been successful in path planning of robots with many degrees of freedom, but narrow passages in a robot’s configuration space create s...
David Hsu, Tingting Jiang, John H. Reif, Zheng Sun
ESA
2009
Springer
144views Algorithms» more  ESA 2009»
13 years 11 months ago
Narrow-Shallow-Low-Light Trees with and without Steiner Points
We show that for every set S of n points in the plane and a designated point rt ∈ S, there exists a tree T that has small maximum degree, depth and weight. Moreover, for every po...
Michael Elkin, Shay Solomon