Sciweavers

1552 search results - page 232 / 311
» On the Complexity of Constant Propagation
Sort
View
CSR
2007
Springer
16 years 18 days ago
Ruling Out Polynomial-Time Approximation Schemes for Hard Constraint Satisfaction Problems
The maximum constraint satisfaction problem (Max CSP) is the following computational problem: an instance is a finite collection of constraints on a set of variables, and the goal...
Peter Jonsson, Andrei A. Krokhin, Fredrik Kuivinen
ECAL
2007
Springer
16 years 18 days ago
Controlling an Anthropomimetic Robot: A Preliminary Investigation
The human body has a complex skeleton, giving a very high number of degrees of freedom, and is actuated by a large number of elastic elements muscles and tendons. As a consequence,...
Hugo Gravato Marques, Richard Newcombe, Owen Holla...
EVOW
2007
Springer
16 years 18 days ago
Toward Greater Artistic Control for Interactive Evolution of Images and Animation
We present several practical improvements to the interactive evolution of 2D images, some of which are also applicable to more general genetic programming problems. We introduce tr...
David A. Hart
ICDT
2007
ACM
141views Database» more  ICDT 2007»
16 years 18 days ago
Exact XML Type Checking in Polynomial Time
Stay macro tree transducers (smtts) are an expressive formalism for reasoning about XSLT-like document transformations. Here, we consider the exact type checking problem for smtts....
Sebastian Maneth, Thomas Perst, Helmut Seidl
ISAAC
2007
Springer
156views Algorithms» more  ISAAC 2007»
16 years 17 days ago
Approximate Range Searching in External Memory
In this paper, we present two linear-size external memory data structures for approximate range searching. Our first structure, the BAR-B-tree, stores a set of N points in Rd and ...
Micha Streppel, Ke Yi