13841 search results - page 149 / 2769 » Algorithms and Constraint Programming |
125
click to vote
CP
2006
Springer
15 years 8 months ago
2006
Springer
Abstract. We extend the common depth-first backtrack search for constraint satisfaction problems with randomized variable and value selection. The resulting methods are applied to ...
152
click to vote
ENTCS
2007
15 years 4 months ago
2007
In this paper we present our rst approach to model and verify biological systems using ntcc, a concurrent constraint process calculus. We argue that the partial information const...
168
click to vote
POPL
2010
ACM
15 years 7 months ago
2010
ACM
Angelic nondeterminism can play an important role in program development. It simplifies specifications, for example in deriving programs with a refinement calculus; it is the form...
176
click to vote
TRIER
2002
15 years 4 months ago
2002
It is known that interprocedural detection of copy constants and elimination of faint code in parallel programs are undecidable problems, if base statements are assumed to execute...
128
click to vote
AAAI
2008
15 years 7 months ago
2008
We address the problem of effective reuse of subproblem solutions in dynamic programming. In dynamic programming, a memoed solution of a subproblem can be reused for another if th...