Deriving information from sampling and diving

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5883 LNAI, Issue , 2009, Pages 82-91

  Lombardi, Michele ^a   Milano, Michela ^a   Roli, Andrea ^b   Zanarini, Alessandro ^c  

^a UNIVERSITY OF BOLOGNA   (Italy)

^b UNIVERSITY OF BOLOGNA   (Italy)

^c ÉCOLE POLYTECHNIQUE DE MONTRÉAL   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

CONSTRAINT PROPAGATION; CONSTRAINT SATISFACTION PROBLEMS; CSP SOLVING; DEPTH FIRST SEARCH; FEASIBLE SOLUTION; HUGE SAMPLES; PARTIAL LATIN SQUARES; SEARCH SPACES; UNIFORM SAMPLING; VALUE ASSIGNMENT;

ARTIFICIAL INTELLIGENCE; EXTRACTION; RANDOM VARIABLES; SAMPLING; SPACE PLATFORMS;

QUALITY CONTROL;

EID: 78650682003     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-10291-2_9     Document Type: Conference Paper

References (13)

1. Katsirelos, G., Bacchus, F.: Generalized NoGoods in CSPs. In: Proc. of AAAI 2005, pp. 390-396 (2005)
2. Beck, J.C.: Multi-Point Constructive Search. In: van Beek, P. (ed.) CP 2005. LNCS, vol. 3709, pp. 737-741. Springer, Heidelberg (2005)
3. Gogate, V., Dechter, R.: A New Algorithm for Sampling CSP Solutions Uniformly at Random. In: Benhamou, F. (ed.) CP 2006. LNCS, vol. 4204, pp. 711-715. Springer, Heidelberg (2006)
4. Gogate, V., Dechter, R.: A Simple Application of Sampling Importance Resampling to Solution Sampling. In: Proc. of CP 2007, pp. 711-715 (2007)
5. Gomes, C., Sabharwal, A., Selman, B.: Near-Uniform Sampling of Combinatorial Spaces Using XOR Constraints. In: Proc. of the 20th Annual Conference on Neural Information Processing Systems, pp. 481-488 (2006)
6. Gomes, C., Shmoys, D.: Completing Quasigroups or Latin Squares: A Structured Graph Coloring Problem. In: Proc. of COLOR 2002, pp. 22-39 (2002)
7. Gomes, C.P., Shmoys, D.B.: Approximations and Randomization to Boost CSP Techniques. Annals OR 130(1-4), 117-141 (2004)
8. Grimes, D., Wallace, R.J.: Learning to Identify Global Bottlenecks in Constraint Satisfaction Search. In: Proc. of FLAIRS-20, pp. 592-598 (2007)
9. van Hoeve, W.J., Milano, M.: Decomposition Based Search. A theoretical and experimental evaluation. LIA Technical Report, University of Bologna (2003)
10. Papoulis, A., Pillai, S.U.: Probability, random variables and stochastic processes. Mac-Graw Hill, Newyork (2001)
11. Refalo, P.: Impact-based search strategies for constraint programming. In: Wallace, M. (ed.) CP 2004. LNCS, vol. 3258, pp. 557-571. Springer, Heidelberg (2004)
12. Ruml, W.: Adaptive Tree Search. Ph.D. thesis, Harvard University (2002)
13. Lombardi, M., Milano, M., Roli, A., Zanarini, A.: Deriving information from sampling and diving. LIA Tech report LIA-006-09, http://www-lia.deis.unibo. it/Research/TechReport/lia09006.pdf