Sciweavers

55 search results - page 7 / 11
» cp 2003
Sort
View
CP
2003
Springer
14 years 25 days ago
Propagation Redundancy in Redundant Modelling
Combining mutually redundant models with channelling constraints increases constraint propagation. However, the extra computation efforts of the additional variables and constraint...
Chiu Wo Choi, Jimmy Ho-Man Lee, Peter J. Stuckey
CSB
2003
IEEE
113views Bioinformatics» more  CSB 2003»
14 years 27 days ago
An Optimal DNA Segmentation Based on the MDL Principle
: The biological world is highly stochastic and inhomogeneous in its behaviour. There are regions in DNA with high concentration of G or C bases; stretches of sequences with an abu...
Wojciech Szpankowski, Wenhui Ren, Lukasz Szpankows...
CP
2005
Springer
14 years 1 months ago
AND/OR Branch-and-Bound for Solving Mixed Integer Linear Programming Problems
Abstract. AND/OR search spaces have recently been introduced as a unifying paradigm for advanced algorithmic schemes for graphical models. The main virtue of this representation is...
Radu Marinescu 0002, Rina Dechter
IJCAI
2003
13 years 9 months ago
Automated Generation of Understandable Contingency Plans
Markov decision processes (MDPs) and contingency planning (CP) are two widely used approaches to planning under uncertainty. MDPs are attractive because the model is extremely gen...
Max Horstmann, Shlomo Zilberstein
CP
2003
Springer
14 years 25 days ago
Comparison of Symmetry Breaking Methods
Symmetry in a Constraint Satisfaction Problem can cause wasted search, which can be avoided by adding constraints to the CSP to exclude symmetric assignments or by modifying the s...
Karen E. Petrie