11 search results - page 2 / 3 » A Logic-Based Approach to Combinatorial Testing with Constra... |
108
click to vote
CORR
2010
Springer
14 years 11 months ago
2010
Springer
We investigate Monte Carlo Markov Chain (MCMC) procedures for the random sampling of some one-dimensional lattice paths with constraints, for various constraints. We will see that...
135
click to vote
AMAI
1999
Springer
14 years 11 months ago
1999
Springer
Logic programming with the stable model semantics is put forward as a novel constraint programming paradigm. This paradigm is interesting because it bring advantages of logic prog...
104
Voted
AIMSA
2008
Springer
15 years 1 months ago
2008
Springer
Abstract. Constraint Satisfaction has been widely used to model static combinatorial problems. However, many AI problems are dynamic and take place in a distributed environment, i....
171
click to vote
IJCV
2006
14 years 11 months ago
2006
Combinatorial graph cut algorithms have been successfully applied to a wide range of problems in vision and graphics. This paper focusses on possibly the simplest application of gr...
107
click to vote
AAAI
1990
15 years 22 days ago
1990
This paper presents a new approach for exploiting Truth Maintenance Systems(TMSs) which makes them simpler to use without necessarily incurring a substantial performance penalty. ...