Russian doll search with tree decomposition

IJCAI International Joint Conference on Artificial Intelligence

Volumn , Issue , 2009, Pages 603-608

  Sanchez, M ^a   Allouche, D ^a   De Givry, S ^a   Schiex, T ^a  

^a CEMAGREF   (France)

Author keywords

[No Author keywords available]

Indexed keywords

BRANCH AND BOUND METHOD;

ASYMPTOTIC TIME COMPLEXITY; BRANCH-AND-BOUND ALGORITHMS; FREQUENCY ASSIGNMENTS; GRAPHICAL MODEL; ITS EFFICIENCIES; MAXIMUM SATISFIABILITY; PROBABILISTIC NETWORK; TREE-DECOMPOSITION;

FORESTRY;

EID: 78149240543     PISSN: 10450823     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (21)

1. A. Choi, N. Zaitlen, B. Han, K. Pipatsrisawat, A. Darwiche, and E. Eskin. Efficient Genome Wide Tagging by Reduction to SAT. In Proc. of WABI-08, volume 5251 of LNCS, pages 135-147, 2008.
2. B. Cabon, S. de Givry, and G. Verfaillie. Anytime Lower Bounds for Constraint Optimization Problems. In Proc. of CP-98, pages 117-131, Pisa, Italy, 1998.
3. B. Cabon, S. de Givry, L. Lobjois, T. Schiex, and J.P. Warners. Radio link frequency assignment. Constraints Journal, 4:79-89, 1999.
4. C. S. Carlson, M. A. Eberle, M. J. Rieder, Q. Yi, L. Kruglyak, and D. A. Nickerson. Selecting a maximally informative set of single-nucleotide polymorphisms for association analyses using linkage disequilibrium. Am. J. Hum. Genet., 74(1):106-120, 2004.
5. M. Cooper and T. Schiex. Arc consistency for soft constraints. Artificial Intelligence, 154:199-227, 2004.
6. A. Darwiche. Recursive Conditioning. Artificial Intelligence, 126(1-2):5-41, 2001.
7. S. de Givry, M. Zytnicki, F. Heras, and J. Larrosa. Existential arc consistency: Getting closer to full arc consistency in weighted CSPs. In Proc. of IJCAI-05, pages 84-89, Edinburgh, Scotland, 2005.
8. S. de Givry, T. Schiex, and G. Verfaillie. Exploiting Tree Decomposition and Soft Local Consistency in Weighted CSP. In Proc. of AAAI-06, Boston, MA, 2006.
9. S. de Givry. Singleton consistency and dominance for weighted CSP. In Proc. of Soft Constraints workshop, 2004.
10. E. Freuder and M. Quinn. Taking advantage of stable sets of variables in constraint satisfaction problems. In Proc. of IJCAI-85, pages 1076-1078, Los Angeles, CA, 1985.
11. J.N. Hirschhorn and M.J. Daly. Genome-wide association studies for common diseases and complex traits. Nature Reviews Genetics, 6(2):95-108, 2005.
12. P. Jégou, S. N. Ndiaye, and C. Terrioux. Dynamic management of heuristics for solving structured CSPs. In Proc. of CP-07, pages 364-378, Providence, USA, 2007.
13. J. Larrosa and T. Schiex. Solving Weighted CSP by Maintaining Arc-consistency. Artificial Intelligence, 159(1-2):1-26, 2004.
14. J. Larrosa, P. Meseguer, and M. Sanchez. Pseudo-tree search with soft constraints. In Proc. of ECAI-02, pages 131-135, Lyon, France, 2002.
15. C. Lecoutre, L. Sais, S. Tabary, and V. Vidal. Last conflict based reasoning. In Proc. of ECAI-2006, pages 133-137, Trento, Italy, 2006.
16. R. Marinescu and R. Dechter. Memory intensive branch-and-bound search for graphical models. In Proc. of AAAI-06, Boston, MA, 2006.
17. Z. S. Qin, S. Gopalakrishnan, and G. R. Abecasis. An efficient comprehensive search algorithm for tagsnp selection using linkage disequilibrium criteria. Bioinformatics, 22(2):220-225, 2006.
18. M. Sanchez, S. de Givry, and T. Schiex. Mendelian error detection in complex pedigrees using weighted constraint satisfaction techniques. Constraints, 13(1):130-154, 2008.
19. th IJCAI, pages 631-637, Montréal, Canada, 1995.
20. C. Terrioux and P. Jegou. Hybrid back-tracking bounded by tree-decomposition of constraint networks. Artificial Intelligence, 146(1):43-75, 2003.
21. G. Verfaillie, M. Lemaître, and T. Schiex. Russian Doll Search for Solving Constraint Optimization Problems. In Proc. of AAAI-96, pages 181-187, Portland, OR, 1996.