450 search results - page 16 / 90 » Algorithmic uses of the Feferman-Vaught Theorem |
FOCS
2002
IEEE
14 years 13 days ago
2002
IEEE
The Constraint Satisfaction Problem (CSP) provides a common framework for many combinatorial problems. The general CSP is known to be NP-complete; however, certain restrictions on...
CAGD
2006
13 years 7 months ago
2006
Abstract. Volino and Thalmann have published a conjecture proposing sufficient conditions for non-selfintersection of surfaces. Such conditions may be used in solid modeling, compu...
EUROPAR
2006
Springer
13 years 11 months ago
2006
Springer
Computations on two-dimensional arrays such as matrices and images are one of the most fundamental and ubiquitous things in computational science and its vast application areas, bu...
CONCUR
2003
Springer
14 years 21 days ago
2003
Springer
Abstract. We apply the theory of asynchronous automata to the synthesis problem of closed distributed systems. We use safe asynchronous automata as implementation model, and charac...
DIAGRAMS
2004
Springer
14 years 26 days ago
2004
Springer
An important aim of diagrammatic reasoning is to make it easier for people to create and understand logical arguments. We have worked on spider diagrams, which visually express log...