Combining multiple heuristics

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

Volumn 3884 LNCS, Issue , 2006, Pages 242-253

  Sayag, Tzur ^a   Fine, Shai ^b   Mansour, Yishay ^a  

^a TEL AVIV UNIVERSITY   (Israel)

^b IBM HAIFA RESEARCH LAB   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

COSTS; PROBABILISTIC LOGICS; PROBLEM SOLVING; SCHEDULING;

MULTIPLE HEURISTICS; OPTIMAL SCHEDULES; PROBABILISTIC CONFIGURATION; PROBLEM INSTANCES;

HEURISTIC METHODS;

EID: 33745624248     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11672142_19     Document Type: Conference Paper

References (11)

1. M. Anthony and Peter L. Bartlett, Neural network learning: Theoretical foundations, Cambridge University Presss, 1999.
2. Boris Aronov, Jiri Matousek, and Micha Sharir, On the sum of squares of cell complexities in hyperplane arrangements, SCG'91: Proceedings of the seventh annual symposium on Computational geometry (New York, NY, USA), ACM Press, 1991, pp. 307-313.
3. Nicolò Cesa-Bianchi, Yoav Freund, David P. Helmbold, David Haussler, Robert E. Schapire, and Manfred K. Warmuth, How to use expert advice, Journal of the ACM 44 (1997), no. 3, 427-485.
4. Mark de Berg, Marc van Kreveld, Mark Overmars, and Ptfried Schwarzkopf, Computational geometry algorithms and applications, second, revised ed., ch. 8, pp. 172-180, Springer, 2000.
5. Herbert Edelsbrunner, Algorithms in combinatorial geometry, Springer-Verlag New York, Inc., New York, NY, USA, 1987.
6. E. Giunchiglia, M. Maratea, A. Tacchella, and D. Zambonin, Evaluating search heuristics and optimization techniques in propositional satisfiability, Proceedings of International Joint Conference on Automated Reasoning (IJCAR'01) (Siena), June 2001, to appear.
7. D. Halperin, Arrangements, Handbook of Discrete and Computational Geometry (Jacob E. Goodman and Joseph O'Rourke, eds.), CRC Press LLC, Boca Raton, FL, 2004, pp. 529-562.
8. Dorit S. Hochbaum (ed.), Approximation algorithms for NP-hard problems, PWS Publishing Co., Boston, MA, USA, 1997.
9. O. Kullmann, Heuristics for SAT algorithms: Searching for some foundations, September 1998, 23 pages, updated September 1999 w.r.t. running times, url = http://cs-svrl.swan.ac.uk/csoliver/heur2letter.ps.gz.
10. Chu-Min Li and Anbulagan, Heuristics based on unit propagation for satisfiability problems, Proceedings of the Fifteenth International Joint Conference on Artificial Intelligence (IJCAF'97) (Nagoya, Japan), August 23-29 1997, pp. 366-371.
11. M. Pinedo, Scheduling theory, algorithms and systems, Prentice-Hall International Series in Industrial and Systems EngineeringPrentice-Hall: Englewood Cliffs, NJ, 1995.