1381 search results - page 129 / 277 » Computational Complexity of Constraint Satisfaction |
149
click to vote
ARTS
1999
Springer
15 years 8 months ago
1999
Springer
Program compilation can be formally defined as a sequence of equivalence-preserving transformations, or refinements, from highlevel language programs to assembler code. Recent mo...
138
click to vote
WSCG
2001
15 years 5 months ago
2001
In computer graphics and engineering many classes of complex objects can be designed with L-systems. We present a concept for enhancing timed and parametric L-systems with physics...
134
click to vote
CIAC
2003
Springer
15 years 9 months ago
2003
Springer
Abstract. We consider problems of (new) station placement along (existing) railway tracks, so as to increase the number of users. We prove that, in spite of the NP-hardness for the...
145
click to vote
CP
2010
Springer
15 years 2 months ago
2010
Springer
Abstract. We study the lattice structure of sets (monoids) of surjective hyper-operations on an n-element domain. Through a Galois connection, these monoids form the algebraic coun...
156
click to vote
UAI
1997
15 years 5 months ago
1997
This paper describes a class ofprobabilistic approximation algorithms based on bucket elimination which o er adjustable levels of accuracy ande ciency. We analyzethe approximation...