Impact of censored sampling on the performance of restart strategies

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

Volumn 4204 LNCS, Issue , 2006, Pages 167-181

  Gagliolo, Matteo ^a,b   Schmidhuber, Jürgen ^a,c  

^a DALLE MOLLE INSTITUTE FOR ARTIFICIAL INTELLIGENCE IDSIA   (Switzerland)

^b UNIVERSITY OF LUGANO   (Switzerland)

^c TECHNICAL UNIVERSITY OF MUNICH   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

GRAPH THEORY; OPTIMIZATION; PROBABILITY; PROBLEM SOLVING; SAMPLING;

ALGORITHM SELECTION; CENSORED SAMPLING; OPTIMAL RESTART STRATEGY;

ALGORITHMS;

EID: 33750310050     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11889205_14     Document Type: Conference Paper

References (25)

1. Gomes, C.P., Fernandez, C., Selman, B., Bessiere, C.: Statistical regimes across constrainedness regions. Constraints 10(4) (2005) 317-337
2. Rice, J.R.: The algorithm selection problem. In Rubinoff, M., Yovits, M.C., eds.: Advances in computers. Volume 15. Academic Press, New York (1976) 65-118
3. Hogg, T., Williams, C.P.: The hardest constraint problems: a double phase transition. Artif. Intell. 69(1-2) (1994) 359-377
4. Gomes, C.P., Selman, B., Crato, N., Kautz, H.: Heavy-tailed phenomena in satisfiability and constraint satisfaction problems. J. Autom. Reason. 24(1-2) (2000) 67-100
5. Huberman, B.A., Lukose, R.M., Hogg, T.: An economic approach to hard computational problems. Science 275 (1997) 51-54
6. Luby, M., Sinclair, A., Zuckerman, D.: Optimal speedup of las vegas algorithms. Inf. Process. Lett. 47(4) (1993) 173-180
7. Gomes, C.P., Selman, B.: Algorithm portfolios. Artificial Intelligence 126(1-2) (2001) 43-62
8. Nelson, W.: Applied Life Data Analysis. John Wiley, New York (1982)
9. Li, C.M., Anbulagan: Heuristics based on unit propagation for satisfiability problems, In: IJCAI97. (1997) 366-371
10. Hoos, H.H., Stützte, T.: SATLIB: An Online Resource for Research on SAT. In I.P.Gent, H.v.Maaren, T.W., ed.: SAT 2000, IOS press (2000) 283-292 http://www.satlib.org.
11. Frost, D., Rish, I., Vila, L.: Summarizing csp hardness with continuous probability distributions. In: AAAI/IAAI. (1997) 327-333
12. van Moorsel, A.P.A., Wolter, K.: Analysis and algorithms for restart. In: QEST '04: Proceedings of the The Quantitative Evaluation of Systems, First International Conference on (QEST'04), Washington, DC, USA, IEEE Computer Society (2004) 195-204
13. Hoos, H.H.: On the run-time behaviour of stochastic local search algorithms for sat. In: Proceedings of the Sixteenth National Conference on Artificial Intelligence (AAAI'99), Orlando, Florida (1999) 661-666
14. Hoos, H.H., Stützte, T.: Local search algorithms for SAT: An empirical evaluation. Journal of Automated Reasoning 24(4) (2000) 421-481
15. Hoos, H.H.: A mixture-model for the behaviour of sis algorithms for sat. In: Eighteenth national conference on Artificial intelligence, Menlo Park, CA, USA, American Association for Artificial Intelligence (2002) 661-667
16. Boddy, M., Dean, T.L.: Deliberation scheduling for problem solving in time-constrained environments. Artificial Intelligence 67(2) (1994) 245-285
17. Hansen, E.A., Zilberstein, S.: Monitoring and control of anytime algorithms: A dynamic programming approach. Artificial Intelligence 126(1-2) (2001) 139-157
18. Alt, H., Guibas, L., Mehlhorn, K., Karp, R., Widgerson, A.: A method for obtaining randomized algorithms with small tail probalities. Research Report MPI-I-92-110, Max-Planck-Institut für Informatik, Im Stadtwald, D-66123 Saarbrücken, Germany (1992)
19. Gomes, C.P., Selman, B., Kautz, H.: Boosting combinatorial search through randomization. In: AAAI '98/IAAI '98: Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence, Menlo Park, CA, USA, American Association for Artificial Intelligence (1998) 431-437
20. Kautz, H., Horvitz, E., Ruan, Y., Gomes, C., Selman, B.: Dynamic restart policies (2002)
21. Gagliolo, M., Schmidhuber, J.: A neural network model for inter-problem adaptive online time allocation. In Duch, W., et al., eds.: Artificial Neural Networks: Formal Models and Their Applications - ICANN 2005, Part 2, Springer (2005) 7-12
22. Gagliolo, M., Schmidhuber, J.: Dynamic algorithm portfolios. In: Ninth International Symposium on Artificial Intelligence and Mathematics, Fort Lauderdale, Florida, January 2006. (2006)
23. Gent, I., Hoos, H.H., Prosser, P., Walsh, T.: Morphing: Combining structure and randomness. In: Proc. of AAAI-99. (1999) 654-660 -Benchmark available at http://www.intellektik.informatik.tu-darmstadt.de/SATLIB/ Benchmarks/SAT/SW-GCP/descr.html.
24. Reed, W.: The double pareto-lognormal distribution - a new parametric model for size distribution (2001) - Available at http://www.math.uvic.ca/ faculty/reed/index.html.
25. Kaplan, E., Meyer, P.: Nonparametric estimation from incomplete samples. J. of the ASA 73 (1958) 457-481