메뉴 건너뛰기




Volumn , Issue , 2001, Pages 235-241

Incomplete tree search using adaptive probing

Author keywords

[No Author keywords available]

Indexed keywords

BOOLEAN SATISFIABILITY; DEPTH FIRST SEARCH; EMPIRICAL ANALYSIS; GENERIC TREE; LOCAL SEARCH; NUMBER PARTITIONING; SEARCH TREES; TREE SEARCH;

EID: 26944483800     PISSN: 10450823     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (15)

References (23)
  • 2
    • 0031634750 scopus 로고    scopus 로고
    • Fast probabilistic modeling for combinatorial optimization
    • Shumeet Baluja and Scott Davies. Fast probabilistic modeling for combinatorial optimization. In Proceedings of AAAI-98, 1998.
    • Proceedings of AAAI-98, 1998
    • Baluja, S.1    Davies, S.2
  • 3
    • 84899021239 scopus 로고    scopus 로고
    • Genetic algorithms and explicit search statistics
    • Michael C. Mozer, Michael I. Jordan, and Thomas Petsche, editors
    • Shumeet Baluja. Genetic algorithms and explicit search statistics. In Michael C. Mozer, Michael I. Jordan, and Thomas Petsche, editors, Advances in Neural Information Processing Systems 9, 1997.
    • (1997) Advances in Neural Information Processing Systems 9
    • Baluja, S.1
  • 4
    • 32044463507 scopus 로고    scopus 로고
    • PhD thesis, University of Oregon, Eugene, OR, August
    • Tania Bedrax-Weiss. Optimal Search Protocols. PhD thesis, University of Oregon, Eugene, OR, August 1999.
    • (1999) Optimal Search Protocols
    • Bedrax-Weiss, T.1
  • 5
    • 0000692965 scopus 로고
    • A new adaptive multi-start technique for combinatorial global optimizations
    • Kenneth D. Boese, Andrew B. Kahng, and Sudhakar Muddu. A new adaptive multi-start technique for combinatorial global optimizations. Operations Research Letters, 16:101-113, 1994.
    • (1994) Operations Research Letters , vol.16 , pp. 101-113
    • Boese, K.D.1    Kahng, A.B.2    Muddu, S.3
  • 6
    • 0031625420 scopus 로고    scopus 로고
    • Learning evaluation functions for global optimization and boolean satisfiability
    • Justin A. Boyan and Andrew W. Moore. Learning evaluation functions for global optimization and boolean satisfiability. In Proceedings of AAAI-98, 1998.
    • Proceedings of AAAI-98, 1998
    • Boyan, J.A.1    Moore, A.W.2
  • 7
    • 0030354252 scopus 로고    scopus 로고
    • Heuristic-biased stochastic sampling
    • John L. Bresina. Heuristic-biased stochastic sampling. In Proceedings of AAAI-96, pp 271-278, 1996.
    • (1996) Proceedings of AAAI-96 , pp. 271-278
    • Bresina, J.L.1
  • 8
    • 0030145382 scopus 로고    scopus 로고
    • Worst-case quadratic loss bounds for on-line prediction of linear functions by gradient descent
    • Nicolò Cesa-Bianchi, Philip M. Long, and Manfred K. Warmuth. Worst-case quadratic loss bounds for on-line prediction of linear functions by gradient descent. IEEE Transactions on Neural Networks, 7(2):604-619, 1996.
    • (1996) IEEE Transactions on Neural Networks , vol.7 , Issue.2 , pp. 604-619
    • Cesa-Bianchi, N.1    Long, P.M.2    Warmuth, M.K.3
  • 9
    • 0028603245 scopus 로고
    • Experimental results on the application of satisfiability algorithms to scheduling problems
    • James M. Crawford and Andrew B. Baker. Experimental results on the application of satisfiability algorithms to scheduling problems. In Proceedings of AAAI-94, pages 1092-1097, 1994.
    • (1994) Proceedings of AAAI-94 , pp. 1092-1097
    • Crawford, J.M.1    Baker, A.B.2
  • 10
    • 0031122887 scopus 로고    scopus 로고
    • Ant colony system: A cooperative learning approach to the traveling salesman problem
    • Marco Dorigo and Luca Maria Gambardella. Ant colony system: A cooperative learning approach to the traveling salesman problem. IEEE Transactions on Evolutionary Computation, 1(1):53-66, 1997.
    • (1997) IEEE Transactions on Evolutionary Computation , vol.1 , Issue.1 , pp. 53-66
    • Dorigo, M.1    Gambardella, L.M.2
  • 12
    • 0001905310 scopus 로고    scopus 로고
    • Phase transitions and annealed theories: Number partitioning as a case study
    • Ian P. Gent and Toby Walsh. Phase transitions and annealed theories: Number partitioning as a case study. In Proceedings of ECAI-96, 1996.
    • Proceedings of ECAI-96, 1996
    • Gent, I.P.1    Walsh, T.2
  • 13
    • 84880915061 scopus 로고
    • Dts: A decision-theoretic scheduler for space telescope applications
    • Monte Zweben and Mark S. Fox, editors, chapter 13 Morgan Kaufmann, San Francisco
    • Othar Hansson and Andrew Mayer. Dts: A decision-theoretic scheduler for space telescope applications. In Monte Zweben and Mark S. Fox, editors, Intelligent Scheduling, chapter 13, pages 371-388. Morgan Kaufmann, San Francisco, 1994.
    • (1994) Intelligent Scheduling , pp. 371-388
    • Hansson, O.1    Mayer, A.2
  • 15
    • 0001047763 scopus 로고
    • Optimization by simulated annealing: An experimental evaluation; Part II, graph coloring and number partitioning
    • May-June
    • David S. Johnson, Cecilia R. Aragon, Lyle A. McGeoch, and Catherine Schevon. Optimization by simulated annealing: An experimental evaluation; Part II, graph coloring and number partitioning. Operations Research, 39(3):378-406, May-June 1991.
    • (1991) Operations Research , vol.39 , Issue.3 , pp. 378-406
    • Johnson, D.S.1    Aragon, C.R.2    McGeoch, L.A.3    Schevon, C.4
  • 16
    • 0031628695 scopus 로고    scopus 로고
    • "Squeaky wheel" optimization
    • MIT Press
    • David E. Joslin and David P. Clements. "Squeaky wheel" optimization. In Proceedings of AAAI-98, pages 340-346. MIT Press, 1998.
    • (1998) Proceedings of AAAI-98 , pp. 340-346
    • Joslin, D.E.1    Clements, D.P.2
  • 17
    • 0031643567 scopus 로고    scopus 로고
    • A sampling-based heuristic for tree search applied to grammar induction
    • MIT Press
    • Hughes Juillé and Jordan B. Pollack. A sampling-based heuristic for tree search applied to grammar induction. In Proceedings of AAAI-98, pages 776-783. MIT Press, 1998.
    • (1998) Proceedings of AAAI-98 , pp. 776-783
    • Juillé, H.1    Pollack, J.B.2
  • 20
    • 0001899512 scopus 로고    scopus 로고
    • From approximate to optimal solutions: A case study of number partitioning
    • Richard E. Korf. From approximate to optimal solutions: A case study of number partitioning. In Proceedings of IJCAI-95, 1995.
    • Proceedings of IJCAI-95, 1995
    • Korf, R.E.1
  • 21
    • 0030361834 scopus 로고    scopus 로고
    • Improved limited discrepancy search
    • Richard E. Korf. Improved limited discrepancy search. In Proceedings of AAAI-96, pp 286-291, 1996.
    • (1996) Proceedings of AAAI-96 , pp. 286-291
    • Korf, R.E.1
  • 22
    • 84880662655 scopus 로고    scopus 로고
    • Interleaved depth-first search
    • Pedro Meseguer. Interleaved depth-first search. In Proceedings of IJCAI-97, pp 1382-1387, 1997.
    • (1997) Proceedings of IJCAI-97 , pp. 1382-1387
    • Meseguer, P.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.