Sciweavers

2316 search results - page 85 / 464
» The many forms of hypercomputation
Sort
View
ECAI
2008
Springer
15 years 5 months ago
Regression for Classical and Nondeterministic Planning
Many forms of reasoning about actions and planning can be reduced to regression, the computation of the weakest precondition a state has to satisfy to guarantee the satisfaction of...
Jussi Rintanen
DLT
2010
15 years 4 months ago
Minimization of Deterministic Bottom-Up Tree Transducers
We show that for every deterministic bottom-up tree transducer, a unique equivalent transducer can be constructed which is minimal. The construction is based on a sequence of norma...
Sylvia Friese, Helmut Seidl, Sebastian Maneth
CGF
2010
127views more  CGF 2010»
15 years 4 months ago
On Discrete Killing Vector Fields and Patterns on Surfaces
Symmetry is one of the most important properties of a shape, unifying form and function. It encodes semantic information on one hand, and affects the shape's aesthetic value ...
Mirela Ben-Chen, Adrian Butscher, Justin Solomon, ...
FOCM
2008
59views more  FOCM 2008»
15 years 4 months ago
Semidefinite Characterization and Computation of Zero-Dimensional Real Radical Ideals
For an ideal I R[x] given by a set of generators, a new semidefinite characterization of its real radical I(VR(I)) is presented, provided it is zero-dimensional (even if I is not...
Jean B. Lasserre, Monique Laurent, Philipp Rostals...
CORR
2007
Springer
82views Education» more  CORR 2007»
15 years 4 months ago
Programs as polygraphs: computability and complexity
Abstract – This study presents Albert Burroni’s polygraphs as an algebraic and graphical description of first-order functional programs, where functions can have many outputs....
Guillaume Bonfante, Yves Guiraud