Lattice-Search Runtime Distributions May Be Heavy-Tailed
- 14 March 2003
- book chapter
- Published by Springer Nature
- p. 333-345
- https://doi.org/10.1007/3-540-36468-4_22
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- θ-Subsumption in a Constraint Satisfaction PerspectivePublished by Springer Nature ,2001
- Relational Learning: Hard Problems and Phase TransitionsPublished by Springer Nature ,2000
- Heavy-Tailed Phenomena in Satisfiability and Constraint Satisfaction ProblemsJournal of Automated Reasoning, 2000
- Resource-bounded Relational Reasoning: Induction and Deduction Through Stochastic MatchingMachine Learning, 2000
- Phase Transitions in Relational LearningMachine Learning, 2000
- Feature construction with Inductive Logic Programming: A Study of Quantitative Predictions of Biological Activity Aided by Structural AttributesData Mining and Knowledge Discovery, 1999
- Carcinogenesis predictions using ILPPublished by Springer Nature ,1997
- Locating the phase transition in binary constraint satisfaction problemsArtificial Intelligence, 1996
- Inverse entailment and progolNew Generation Computing, 1995
- Inductive Logic Programming: Theory and methodsThe Journal of Logic Programming, 1994