|
102
|
A Reinforcement Learning Approach to Job-shop Scheduling
– Wei Zhang, Thomas G. Dietterich
- 1995
|
|
39
|
Learning as search optimization: Approximate large margin methods for structured prediction
– Hal Daumé Iii, Daniel Marcu
- 2005
|
|
25
|
Adaptive Constraint Satisfaction: The Quickest First Principle
– James Borrett, Edward P. K. Tsang, Natasha R. Walsh
- 1996
|
|
2802
|
Optimization by simulated annealing
– S. Kirkpatrick, C. D. Gelatt, M. P. Vecchi
- 1983
|
|
516
|
No Free Lunch Theorems for Optimization
– David H. Wolpert, et al.
- 1997
|
|
784
|
Learning logical definitions from relations
– J. R. Quinlan
- 1990
|
|
962
|
Learning Stochastic Logic Programs
– Stephen Muggleton
- 2000
|
|
1135
|
Learning from delayed rewards
– J C Watkins
- 1989
|
|
2960
|
Artificial Intelligence: A Modern Approach. 2nd edn
– S Russell, P Norvig
- 2003
|
|
2
|
From simple features to sophiscated evaluation functions
– Michael Buro
- 1998
|
|
6
|
Learning measures of progress for planning domains
– Sungwook Yoon
- 2005
|
|
148
|
Planning as Heuristic Search: New Results
– Blai Bonet, Héctor Geffner
- 1999
|
|
57
|
Planning Graph as the Basis for Deriving Heuristics for Plan Synthesis by State Space and CSP Search
– Xuanlong Nguyen, Subbarao Kambhampati, Romeo S. Nigenda
- 2000
|
|
463
|
The FF planning system: Fast plan generation through heuristic search
– Jörg Hoffmann, Bernhard Nebel
- 2001
|
|
3
|
The application of ILP to finite element mesh design
– B Dolsak, S Muggleton
- 1991
|
|
9
|
Satisfiability of the Smallest Binary Program
– Philipp Hanschke, Jörg Würtz
- 1993
|
|
15
|
Implication of clauses is undecidable
– M Schmidt-Schauss
- 1988
|
|
23
|
Lattice-Search Runtime Distributions May Be Heavy-Tailed
– Filip Zelezny, Ashwin Srinivasan, David Page
- 2002
|
|
23
|
A study of two sampling methods for analysing large datasets with ILP
– Ashwin Srinivasan
- 1999
|
