9626 search results - page 1619 / 1926 » Invariant Based Programming |
164
click to vote
CP
2007
Springer
16 years 26 days ago
2007
Springer
It is known that Constraint Satisfaction Problems (CSP) can be converted into Boolean Satisfiability problems (SAT); however how to encode a CSP into a SAT problem such that a SAT...
162
Voted
CP
2007
Springer
16 years 26 days ago
2007
Springer
: This report introduces a geometrical constraint kernel for handling the location in space and time of polymorphic k-dimensional objects subject to various geometrical and time co...
127
click to vote
CP
2007
Springer
16 years 26 days ago
2007
Springer
In this paper we present new techniques for improving backtracking based Quantified Constraint Satisfaction Problem (QCSP) solvers. QCSP is a generalization of CSP in which variab...
183
click to vote
DEXA
2007
Springer
16 years 26 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...
179
click to vote
EMSOFT
2007
Springer
16 years 26 days ago
2007
Springer
There is increasing interest in using general-purpose operating systems, such as Linux, on embedded platforms. It is especially important in embedded systems to use memory effici...