Low-knowledge algorithm control

Proceedings of the National Conference on Artificial Intelligence

Volumn , Issue , 2004, Pages 49-54

  Carchrae, Tom ^a   Beck, J Christopher ^a  

^a UNIVERSITY COLLEGE CORK   (Ireland)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CONSTRAINT THEORY; CONTROL SYSTEMS; KNOWLEDGE ACQUISITION; LEARNING SYSTEMS; MATHEMATICAL MODELS; PERFORMANCE; PROBLEM SOLVING; SCHEDULING; SET THEORY;

ACADEMICS; ALGORITHM COMPONENTS; CLASSIFICATION APPROACHES; CONTROL DECISIONS;

RESOURCE ALLOCATION;

EID: 9444254049     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (19)

1. Beck, J. C, and Fox, M. S. 2000. Dynamic problem structure analysis as a basis for constraint-directed scheduling heuristics. Artificial Intelligence 117(1):31-81.
2. Beck, J. C., and Perron, L. 2000. Discrepancy-bounded depth first search. In Proceedings of the Second International Workshop on Integration of AI and OR Technologies for Combinatorial Optimization Problems (CPAIOR'00).
3. Chickering, D. M. 2002. The WinMine toolkit. Technical Report MSR-TR-2002-103, Microsoft, Redmond, WA.
4. Cohen, P. R. 1995. Empirical Methods for Artificial Intelligence. The MIT Press, Cambridge, Mass.
5. Horvitz, E.; Ruan, Y.; Gomes, C.; Kautz, H.; Selman, B.; and Chickering, M. 2001. A bayesian approach to tacking hard computational problems. In Proceedings of the Seventeenth Conference on uncertainty and Artificial Intelligence (UAI-2001), 235-244.
6. Kautz, H.; Horvitz, E.; Ruan, Y.; Gomes, C.; and Selman, B. 2002. Dynamic restart policies. In Proceedings of the Eighteenth National Conference on Artifilcal Intelligence (AMI-02), 674-681.
7. Laborie, P. 2003. Algorithms for propagating resource constraints in AI planning and scheduling: Existing approaches and new results. Artificial Intelligence 143:151-188.
8. Lagoudakis, M. G., and Littman, M. L. 2000. Algorithm selection using reinforcement learning. In Proceedings of the 17th International Conference on Machine Learning, 511-518. Morgan Kaufmann, San Francisco, CA.
9. Le Pape, C.; Perron, L.; Régin, J.; and Shaw, P. 2002. Robust and parallel solving of a network design problem. In Proceedings of the Eighth International Conference on Principles and Practice of Constraint Programming (CP02), 633-648.
10. Leyton-Brown, K.; Nudelman, E.; and Shoham, Y. 2002. Learning the empirical hardness of optimization problems: The case of combinatorial auctions. In Proceedings of the Eighth International Conference on Principles and Practice of Constraint Programming (CP02), 556-572.
11. Luby, M.; Sinclair, A.; and Zuckerman, D. 1993. Optimal speedup of Las Vegas algorithms. Information Processing Letters 47:173-180.
12. Minton, S. 1996. Automatically configuring constraint satisfaction programs: A case study. CONSTRAINTS 1(1,2):7-43.
13. Nowicki, E., and Smutnicki, C. 1996. A fast taboo search algorithm for the job shop problem. Management Science 42(6):797-813.
14. Nuijten, W. P. M. 1994. Time and resource constrained scheduling: a constraint satisfaction approach. Ph.D. Dissertation, Department of Mathematics and Computing Science, Eindhoven University of Technology.
15. Rice, J. 1976. The algorithm selection problem. Advances in Computers 15:65-118.
16. Ruan, Y; Horvitz, E.; and Kautz, H. 2002. Restart policies with dependence among runs: A dynamic programming approach. In Proceedings of the Eighth International Conference on Principles and Practice of Constraint Programming (CP-2002), 573-586. Springer-Verlag.
17. Scheduler. 2001. ILOG Scheduler 5.2 User's Manual and Reference Manual. ILOG, S.A.
18. Watson, J.-P; Barbulescu, L.; Whitley, L.; and Howe, A. 2002. Contrasting structured and random permutation flow-shop scheduling problems: search-space topology and algorithm performance. INFORMS Journal on Computing 14(1).
19. Watson, J.-P. 2003. Empirical Modeling and Analysis of Local Search Algorithms for the Job-Shop Scheduling Problem. Ph.D. Dissertation, Dept. of Computer Science, Colorado State University.