Filip Zelezny, Ashwin Srinivasan, David Page  Home/Search
Context Related
| labe.felk.cvut.cz/~zelezny/...ilp02.pdf comlab.ox.ac.uk/pub/Package...rrr.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: labe.felk.cvut.cz/...publications (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Recent empirical studies show that runtime distributions of backtrack procedures for solving hard combinatorial problems often have intriguing properties. Unlike standard distributions (such as the normal) , such distributions decay slower than exponentially and have "heavy tails". Procedures characterized by heavy-tailed runtime distributions exhibit large variability in efficiency, but a very straightforward method called rapid randomized restarts has been designed to essentially improve... (Update)
Similar documents based on text: More All
0.6: Heavy-Tailed Phenomena in Satisfiability and Constraint.. - Gomes, Selman, Crato.. (1999) (Correct)
0.5: A Monte Carlo Study of Randomised Restarted Search in ILP - Zelezny, Srinivasan, Page (2004) (Correct)
0.5: ILP: A Short Look Back and a Longer Look Forward - Page (Correct)
Related documents from co-citation: More All
10: Nuclear material trafficking: An interim assessment (context) - Williams, Woessner - 1995
8: A study of two sampling methods for analysing large datasets with ILP - Srinivasan - 1999
7: Bagging Predictors - Breiman
BibTeX entry: (Update)
F. Zelezny, A. Srinivasan, and D. Page. Lattice-search runtime distributions may be heavy-tailed. In The Twelfth International Conference on Inductive Logic Programming. Springer Verlag, July 2002. http://citeseer.ist.psu.edu/zelezny02latticesearch.html More
@misc{ zelezny02latticesearch,
author = "F. Zelezny and A. Srinivasan and D. Page",
title = "Lattice-search runtime distributions may be heavy-tailed",
text = "F. Zelezny, A. Srinivasan, and D. Page. Lattice-search runtime distributions
may be heavy-tailed. In The Twelfth International Conference on Inductive
Logic Programming. Springer Verlag, July 2002.",
year = "2002",
url = "citeseer.ist.psu.edu/zelezny02latticesearch.html" }
Citations (may not include all citations):1262 Classification and Regression Trees (context) - Breiman, Friedman et al. - 1984
313 Inductive logic programming: Theory and methods - Muggleton, De Raedt - 1994
124 Boosting combinatorial search through randomization - Gomes, Selman et al. - 1998
85 Theories for mutagenicity: A study in first-order and featur.. - Srinivasan, Muggleton et al. - 1996
59 Locating the phase transition in binary constraint satisfact.. - Smith, Dyer - 1996
55 Special issue on Inductive Logic Programming (context) - Muggleton, Progol et al. - 1995
52 Probability and Statistics for Engineers and Scientists (context) - Walpole, Myers - 1978
34 Heavy-tailed phenomena in satisfiability and constraint sati.. - Gomes, Selman et al. - 2000
33 Feature construction with Inductive Logic Programming: a stu.. - Srinivasan, King - 1999
27 Carcinogenesis predictions using ilp - Srinivasan, King - 1997
21 Summarizing CSP hardness with continuous probability distrib.. - Frost, Rish et al. - 1997
12 Resource-bounded relational reasoning: Induction and deducti.. (context) - Sebag, Rouveirol - 2000
10 Phase transitions in relational learning (context) - Giordana, Saitta - 2000
6 A study of two probabilistic methods for searching large spa.. - Srinivasan - 2000
3 Theta-subsumption in a constraint satisfaction perspective (context) - Maloberti, Sebag - 2001
3 Relational learning: hard problems and phase transitions (context) - Botta, Giordana et al. - 1999
2 Learning on the phase transition edge (context) - Serra, Giordana et al. - 2001
http://web.comlab.ox.ac.uk/oucl/research/areas/machlearn/Aleph/aleph.html
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://labe.felk.cvut.cz/~zelezny/publications.html): More
Connecting Sumatra to Aleph - Zelezny, Aubrecht, Miksovsky (Correct)
Efektivn Prevod Multirelacn Databaze Na Jednorelacn - Reprezentaci Filip Zelezny (Correct)
Learning Functions from Imperfect Positive Data - Zelezny (2001) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC