4940 search results - page 809 / 988 » On the Complexity of Universal Programs |
152
click to vote
CP
2007
Springer
16 years 18 days ago
2007
Springer
We present an algorithm for compressing table constraints representing allowed or disallowed tuples. This type of constraint is used for example in configuration problems, where t...
164
click to vote
CP
2007
Springer
16 years 18 days ago
2007
Springer
Abstract. This paper deals with the problem of solving efficiently structured CSPs. It is well known that (hyper)tree-decompositions offer the best approaches from a theoretical v...
179
click to vote
CPAIOR
2007
Springer
16 years 18 days ago
2007
Springer
The Open-Shop Problem is a hard problem that can be solved using Constraint Programming or Operation Research methods. Existing techniques are efficient at reducing the search tree...
175
click to vote
DEXA
2007
Springer
16 years 18 days ago
2007
Springer
Abstract. Sequence alignment is an important task for molecular biologists. Because alignment basically deals with approximate string matching on large biological sequence collecti...
183
click to vote
EPIA
2007
Springer
16 years 18 days ago
2007
Springer
Recently, the logics of minimal knowledge and negation as failure MKNF [12] was used to introduce hybrid MKNF knowledge bases [14], a powerful formalism for combining open and clos...