메뉴 건너뛰기




Volumn , Issue , 2002, Pages 101-110

A constraint-based architecture for local search

Author keywords

Constraint; Incrementality; Local search; Optimization

Indexed keywords

ALGORITHMS; COMPUTER SOFTWARE REUSABILITY; HEURISTIC METHODS; JAVA PROGRAMMING LANGUAGE; OBJECT ORIENTED PROGRAMMING; OPTIMIZATION;

EID: 0038486673     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (53)

References (30)
  • 2
    • 0038507540 scopus 로고    scopus 로고
    • A framework for the development of local search heuristics with an application to the phylogeny problem
    • A. Andreatta. A framework for the development of local search heuristics with an application to the phylogeny problem, 1997.
    • (1997)
    • Andreatta, A.1
  • 4
    • 84976722628 scopus 로고
    • The programming language aspects of thingLab, a constraint-oriented simulation laboratory
    • A. Borning. The Programming Language Aspects of ThingLab, a Constraint-Oriented Simulation Laboratory. ACM Transaction on Programming Languages and Systems, 3(4):353-387, 1981.
    • (1981) ACM Transaction on Programming Languages and Systems , vol.3 , Issue.4 , pp. 353-387
    • Borning, A.1
  • 6
    • 0037831147 scopus 로고
    • An introduction to prolog III
    • A. Colmerauer. An Introduction to Prolog III. Commun. ACM, 28(4):412-418, 1990.
    • (1990) Commun. ACM , vol.28 , Issue.4 , pp. 412-418
    • Colmerauer, A.1
  • 8
    • 0038507541 scopus 로고    scopus 로고
    • Building reusable software components for heuristic search
    • A. Fink, S. Voss, and D. Woodruff. Building reusable software components for heuristic search, 1998.
    • (1998)
    • Fink, A.1    Voss, S.2    Woodruff, D.3
  • 12
    • 84990479742 scopus 로고
    • An efficient heuristic procedure for partitioning graphs
    • B. Kernighan and S. Lin. An efficient heuristic procedure for partitioning graphs. Bell System Technical Journal, 49:291-307, 1970.
    • (1970) Bell System Technical Journal , vol.49 , pp. 291-307
    • Kernighan, B.1    Lin, S.2
  • 14
    • 0037493628 scopus 로고
    • 2LP: Linear programming and logic programming
    • In V. Saraswat and P. V. Hentenryck, editors; The MIT Press, Cambridge, Ma
    • K. McAloon and C. Tretkoff. 2LP: Linear Programming and Logic Programming. In V. Saraswat and P. V. Hentenryck, editors, Principles and Practice of Constraint Programming. The MIT Press, Cambridge, Ma, 1995.
    • (1995) Principles and Practice of Constraint Programming
    • McAloon, K.1    Tretkoff, C.2
  • 15
  • 17
    • 84914354863 scopus 로고    scopus 로고
    • Solving large-scale constraint satisfaction and scheduling problems using a heuristic repair method
    • S. Minton, M. Johnston, and A. Philips. Solving Large-Scale Constraint Satisfaction and Scheduling Problems using a Heuristic Repair Method. In AAAI-90, August 1990.
    • AAAI-90, August 1990
    • Minton, S.1    Johnston, M.2    Philips, A.3
  • 20
    • 0022953553 scopus 로고
    • Job-shop scheduling using automated reasoning: A case study of the car-sequencing problem
    • B. Parrello, W. Kabat, and L. Wos. Job-Shop Scheduling Using Automated Reasoning: A Case Study of the Car-Sequencing Problem. Journal of Automated Reasoning, 2(1):1-42, 1986.
    • (1986) Journal of Automated Reasoning , vol.2 , Issue.1 , pp. 1-42
    • Parrello, B.1    Kabat, W.2    Wos, L.3
  • 21
    • 0038192631 scopus 로고
    • Bounded incremental computation
    • PhD thesis, University of Wisconsin-Madison
    • G. Ramalingam. Bounded Incremental Computation. PhD thesis, University of Wisconsin-Madison, 1993.
    • (1993)
    • Ramalingam, G.1
  • 22
    • 0038507536 scopus 로고    scopus 로고
    • Local++: A c++ framework for local search algorithms
    • Technical Report 11-99, Dipartimento di Informatica e Sistematica, Universita di Roma, La Sapienza, May
    • A. Schaerf, M. Lenzerini, and M. Cadoli. Local++: A c++ framework for local search algorithms. Technical Report 11-99, Dipartimento di Informatica e Sistematica, Universita di Roma, La Sapienza, May 1999.
    • (1999)
    • Schaerf, A.1    Lenzerini, M.2    Cadoli, M.3
  • 23
    • 0028574681 scopus 로고
    • Noise strategies for improving local search
    • B. Selman, H. Kautz, and B. Cohen. Noise Strategies for Improving Local Search. In AAAI-94, pages 337-343, 1994.
    • (1994) AAAI-94 , pp. 337-343
    • Selman, B.1    Kautz, H.2    Cohen, B.3
  • 24
    • 0003798688 scopus 로고
    • Sketchpad: A man-machine graphical communication system
    • Cambridge, MA, MIT Lincoln Labs
    • I. Sutherland. Sketchpad: a Man-Machine Graphical Communication System. Cambridge, MA, MIT Lincoln Labs, 1963.
    • (1963)
    • Sutherland, I.1
  • 27
    • 0037831139 scopus 로고    scopus 로고
    • The cardinality operator: A new logical connective and its application to constraint logic programming
    • P. Van Hetenryck and Y. Deville. The Cardinality Operator: A New Logical Connective and its Application to Constraint Logic Programming. In ICLP-91, June 1991.
    • ICLP-91, June 1991
    • Van Hetenryck, P.1    Deville, Y.2
  • 29
    • 0042903474 scopus 로고
    • A language for incremental computations
    • Atlanta, Georgia, 22-24 June
    • D. Yellin and S. R. E. Inc: A Language for Incremental Computations. In PLDI'88, pages 115-124, Atlanta, Georgia, 22-24 June 1988.
    • (1988) PLDI'88 , pp. 115-124
    • Yellin, D.1
  • 30


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