199 search results - page 21 / 40 » Computationally and Algebraically Complex Finite Algebra Mem... |
STACS
2010
Springer
14 years 1 months ago
2010
Springer
Abstract. In the constraint satisfaction problem (CSP), the aim is to find an assignment of values to a set of variables subject to specified constraints. In the minimum cost hom...
HYBRID
2010
Springer
14 years 3 months ago
2010
Springer
We present computational techniques for automatically generating algebraic (polynomial equality) invariants for algebraic hybrid systems. Such systems involve ordinary differentia...
CSR
2007
Springer
14 years 2 months ago
2007
Springer
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...
ENTCS
2007
13 years 8 months ago
2007
The basic motivation behind this work is to tie together various computational complexity classes, whether over different domains such as the naturals or the reals, or whether de...
JCAM
2010
13 years 3 months ago
2010
A macroscopic two-fluid model of compressible particle-laden gas flows is considered. The governing equations are discretized by a high-resolution finite element method based on a...