2974 search results - page 74 / 595 » Model-Driven Constraint Programming |
144
click to vote
AAAI
2008
15 years 8 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...
215
click to vote
ICST
2011
IEEE
14 years 9 months ago
2011
IEEE
—Developers have used data structure repair over the last few decades as an effective means to recover on-the-fly from errors in program state. Traditional repair techniques wer...
193
click to vote
CSCLP
2004
Springer
15 years 11 months ago
2004
Springer
We introduce a framework for studying and solving a class of CSP formulations. The framework allows constraints to be expressed as linear and nonlinear equations, then compiles th...
199
click to vote
CP
2008
Springer
15 years 7 months ago
2008
Springer
Modern computer architectures have complex features that can only be fully taken advantage of if the compiler schedules the compiled code. A standard region of code for scheduling ...
154
click to vote
ENTCS
2008
15 years 6 months ago
2008
We explore the relation between the stochastic semantic associated to stochastic Concurrent Constrain Programming (sCCP) and its fluid-flow approximation. Writing the master equat...