메뉴 건너뛰기




Volumn 123, Issue 1-2, 2000, Pages 1-39

Lagrangian reconstruction of GENET

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CONSTRAINT THEORY; HEURISTIC METHODS; LAGRANGE MULTIPLIERS; PROBLEM SOLVING;

EID: 0034301194     PISSN: 00043702     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0004-3702(00)00053-9     Document Type: Article
Times cited : (16)

References (42)
  • 1
    • 49449120803 scopus 로고
    • Consistency in networks of relations
    • Mackworth A.K. Consistency in networks of relations. Artificial Intelligence. 8:(1):1977;99-118.
    • (1977) Artificial Intelligence , vol.8 , Issue.1 , pp. 99-118
    • Mackworth, A.K.1
  • 2
    • 0027001335 scopus 로고
    • A new method for solving hard satisfiability problems
    • AAAI Press/MIT Press
    • Selman B., Levesque H., Mitchell D.G. A new method for solving hard satisfiability problems. Proc. AAAI-92, San Jose, CA. 1992;440-446 AAAI Press/MIT Press.
    • (1992) Proc. AAAI-92, San Jose, CA , pp. 440-446
    • Selman, B.1    Levesque, H.2    Mitchell, D.G.3
  • 6
    • 44049112032 scopus 로고
    • Minimizing conflicts: A heuristic repair method for constraint satisfaction and scheduling problems
    • Minton S., Johnston M.D., Philips A.B., Laird P. Minimizing conflicts: A heuristic repair method for constraint satisfaction and scheduling problems. Artificial Intelligence. 58:1992;161-205.
    • (1992) Artificial Intelligence , vol.58 , pp. 161-205
    • Minton, S.1    Johnston, M.D.2    Philips, A.B.3    Laird, P.4
  • 7
    • 0028593756 scopus 로고
    • GENET: A connectionist architecture for solving constraint satisfaction problems by iterative improvement
    • Davenport A., Tsang E., Wang C., Zhu K. GENET: A connectionist architecture for solving constraint satisfaction problems by iterative improvement. Proc. AAAI-94, Seattle, WA. 1994;325-330.
    • (1994) Proc. AAAI-94, Seattle, WA , pp. 325-330
    • Davenport, A.1    Tsang, E.2    Wang, C.3    Zhu, K.4
  • 8
    • 0027708108 scopus 로고
    • The breakout method for escaping from local minima
    • Morris P. The breakout method for escaping from local minima. Proc. AAAI-93, Washington, DC. 1993;40-45.
    • (1993) Proc. AAAI-93, Washington, DC , pp. 40-45
    • Morris, P.1
  • 11
    • 0003031564 scopus 로고    scopus 로고
    • A discrete Lagrangian-based global-search method for solving satisfiability problems
    • Shang Y., Wah B.W. A discrete Lagrangian-based global-search method for solving satisfiability problems. J. Global Optimization. 12:(1):1998;61-100.
    • (1998) J. Global Optimization , vol.12 , Issue.1 , pp. 61-100
    • Shang, Y.1    Wah, B.W.2
  • 14
    • 0010835183 scopus 로고    scopus 로고
    • Trace-based methods for solving nonlinear global optimization and satisfiability problems
    • Wah B.W., Chang Y.J. Trace-based methods for solving nonlinear global optimization and satisfiability problems. J. Global Optimization. 10:(2):1997;107-141.
    • (1997) J. Global Optimization , vol.10 , Issue.2 , pp. 107-141
    • Wah, B.W.1    Chang, Y.J.2
  • 16
    • 0343649847 scopus 로고    scopus 로고
    • A discrete Lagrangian-based global-search method for solving satisfiability problems
    • D.-Z. Du, J. Gu, & P. Pardalos. Providence, RI: American Mathematical Society
    • Wah B.W., Shang Y. A discrete Lagrangian-based global-search method for solving satisfiability problems. Du D.-Z., Gu J., Pardalos P. Proc. DIMACS Workshop on Satisfiability Problem: Theory and Applications. 1997;365-392 American Mathematical Society, Providence, RI.
    • (1997) Proc. DIMACS Workshop on Satisfiability Problem: Theory and Applications , pp. 365-392
    • Wah, B.W.1    Shang, Y.2
  • 22
    • 0001047763 scopus 로고
    • Optimization by simulated annealing: An experimental evaluation; Part 2: Graph coloring and number partitioning
    • Johnson D., Aragon C., McGeoch L., Schevon C. Optimization by simulated annealing: An experimental evaluation; Part 2: Graph coloring and number partitioning. Oper. Res. 39:(3):1991;378-406.
    • (1991) Oper. Res. , vol.39 , Issue.3 , pp. 378-406
    • Johnson, D.1    Aragon, C.2    McGeoch, L.3    Schevon, C.4
  • 24
    • 0032164194 scopus 로고    scopus 로고
    • Extending GENET with lazy arc consistency
    • Stuckey P.J., Tam V. Extending GENET with lazy arc consistency. IEEE Trans. Systems Man Cybern. 28:(5):1998;698-703.
    • (1998) IEEE Trans. Systems Man Cybern. , vol.28 , Issue.5 , pp. 698-703
    • Stuckey, P.J.1    Tam, V.2
  • 25
    • 0003103215 scopus 로고
    • Domain-independent extensions to GSAT: Solving large structured satisfiability problems
    • Selman B., Kautz H. Domain-independent extensions to GSAT: Solving large structured satisfiability problems. Proc. IJCAI-93, Chambéry, France. 1993;290-295.
    • (1993) Proc. IJCAI-93, Chambéry, France , pp. 290-295
    • Selman, B.1    Kautz, H.2
  • 26
    • 0028574681 scopus 로고
    • Noise strategies for improving local search
    • AAAI Press/MIT Press
    • Selman B., Kautz H.A., Cohen B. Noise strategies for improving local search. Proc. AAAI-94, Seattle, WA. 1994;337-343 AAAI Press/MIT Press.
    • (1994) Proc. AAAI-94, Seattle, WA , pp. 337-343
    • Selman, B.1    Kautz, H.A.2    Cohen, B.3
  • 27
    • 0031628697 scopus 로고    scopus 로고
    • An integer local search method with application to capacitated production planning
    • AAAI Press/MIT Press
    • Walser J.P., Iyer R., Venkatasubramanyan N. An integer local search method with application to capacitated production planning. Proc. AAAI-98, Madison, WI. 1998;373-379 AAAI Press/MIT Press.
    • (1998) Proc. AAAI-98, Madison, WI , pp. 373-379
    • Walser, J.P.1    Iyer, R.2    Venkatasubramanyan, N.3
  • 30
    • 0030105626 scopus 로고    scopus 로고
    • Locating the phase transition in binary constraint satisfaction problems
    • Smith B.M., Dyer M.E. Locating the phase transition in binary constraint satisfaction problems. Artificial Intelligence. 81:1996;155-181.
    • (1996) Artificial Intelligence , vol.81 , pp. 155-181
    • Smith, B.M.1    Dyer, M.E.2
  • 31
    • 0031370396 scopus 로고    scopus 로고
    • Problem structure in the presence of perturbations
    • Gomes C., Selman B. Problem structure in the presence of perturbations. Proc. AAAI-97, Providence, RI. 1997;221-226.
    • (1997) Proc. AAAI-97, Providence, RI , pp. 221-226
    • Gomes, C.1    Selman, B.2
  • 35
    • 84914354863 scopus 로고
    • Solving large-scale constraint satisfaction and scheduling problems using a heuristic repair method
    • AAAI Press/MIT Press
    • Minton S., Johnston M.D., Philips A.B., Laird P. Solving large-scale constraint satisfaction and scheduling problems using a heuristic repair method. Proc. AAAI-90, Boston, MA. 1990;17-24 AAAI Press/MIT Press.
    • (1990) Proc. AAAI-90, Boston, MA , pp. 17-24
    • Minton, S.1    Johnston, M.D.2    Philips, A.B.3    Laird, P.4
  • 36
    • 0030373036 scopus 로고    scopus 로고
    • Weighting for godat: Learning heuristics for GSAT
    • AAAI Press/MIT Press
    • Frank J., Cheeseman P., Allen J. Weighting for godat: Learning heuristics for GSAT. Proc. AAAI-96, Portland, OR. 1996;338-343 AAAI Press/MIT Press.
    • (1996) Proc. AAAI-96, Portland, or , pp. 338-343
    • Frank, J.1    Cheeseman, P.2    Allen, J.3
  • 37
    • 0027706281 scopus 로고
    • Towards an understanding of hill-climbing procedures
    • AAAI Press/MIT Press
    • Gent I.P., Walsh T. Towards an understanding of hill-climbing procedures. Proc. AAAI-93, Washington, DC. 1993;28-33 AAAI Press/MIT Press.
    • (1993) Proc. AAAI-93, Washington, DC , pp. 28-33
    • Gent, I.P.1    Walsh, T.2
  • 38
    • 0031349439 scopus 로고    scopus 로고
    • Solving linear pseudo-boolean constraint problems with local search
    • AAAI Press/MIT Press
    • Walser J.P. Solving linear pseudo-boolean constraint problems with local search. Proc. AAAI-97, Providence, RI. 1997;269-274 AAAI Press/MIT Press.
    • (1997) Proc. AAAI-97, Providence, RI , pp. 269-274
    • Walser, J.P.1
  • 39
    • 26444479778 scopus 로고
    • Optimization by simulated annealing
    • Kirkpatrick S., Gelatt C.D., Vecchi M.P. Optimization by simulated annealing. Science. 220:(4598):1983;671-680.
    • (1983) Science , vol.220 , Issue.4598 , pp. 671-680
    • Kirkpatrick, S.1    Gelatt, C.D.2    Vecchi, M.P.3
  • 40
    • 0027706953 scopus 로고
    • An empirical study of greedy local search for satisfiability testing
    • Selman B., Kautz H. An empirical study of greedy local search for satisfiability testing. Proc. AAAI-93, Washington, DC. 1993;46-51.
    • (1993) Proc. AAAI-93, Washington, DC , pp. 46-51
    • Selman, B.1    Kautz, H.2


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