13841 search results - page 257 / 2769 » Algorithms and Constraint Programming |
138
click to vote
CP
2005
Springer
16 years 5 days ago
2005
Springer
This paper presents a technique for learning parameterized implied constraints. They can be added to a model to improve the solving process. Experiments on implied Gcc constraints ...
215
click to vote
CAV
2004
Springer
15 years 10 months ago
2004
Springer
We study the problem of formally verifying shared memory multiprocessor executions against memory consistency models--an important step during post-silicon verification of multipro...
330
click to vote
POPL
2009
ACM
16 years 7 months ago
2009
ACM
Memory models define an interface between programs written in some language and their implementation, determining which behaviour the memory (and thus a program) is allowed to hav...
170
click to vote
UAI
2008
15 years 8 months ago
2008
Approximate linear programming (ALP) is an efficient approach to solving large factored Markov decision processes (MDPs). The main idea of the method is to approximate the optimal...
157
click to vote
CORR
2002
Springer
15 years 6 months ago
2002
Springer
Abstract. Constraint logic programming combines declarativity and efficiency thanks to constraint solvers implemented for specific domains. Value withdrawal explanations have been ...