메뉴 건너뛰기




Volumn 21, Issue 3-4, 2004, Pages

Saving support-checks does not always save time

Author keywords

Constraint satisfaction; Heuristics; Maintain arc consistency; Search; Space complexity; Time complexity

Indexed keywords

ALGORITHMS; ARTIFICIAL INTELLIGENCE; COMPUTATIONAL COMPLEXITY; DATA ACQUISITION; FREQUENCY AGILITY; HEURISTIC METHODS; OPTIMIZATION; PROBLEM SOLVING;

EID: 3843126408     PISSN: 02692821     EISSN: None     Source Type: Journal    
DOI: 10.1023/B:AIRE.0000036261.28708.7f     Document Type: Conference Paper
Times cited : (11)

References (19)
  • 2
    • 0032639823 scopus 로고    scopus 로고
    • Using constraint metaknowledge to reduce arc consistency computation
    • Bessière, C., Freuder, E. & Régin, J.-C. (1999). Using Constraint Metaknowledge to Reduce Arc Consistency Computation. Artificial Intelligence 107(1): 125-148.
    • (1999) Artificial Intelligence , vol.107 , Issue.1 , pp. 125-148
    • Bessière, C.1    Freuder, E.2    Régin, J.-C.3
  • 6
    • 84957879262 scopus 로고    scopus 로고
    • An empirical study of dynamic variable ordering heuristics for the constraint satisfaction problem
    • E. Freuder (ed.) Berlin: Springer
    • Gent, I., Prosser, M. E. P., Smith, B. & Walsh, T. (1996). An Empirical Study of Dynamic Variable Ordering Heuristics for the Constraint Satisfaction Problem. In E. Freuder (ed.) Principles and Practice of Constraint Programming, 179-193, Berlin: Springer.
    • (1996) Principles and Practice of Constraint Programming , pp. 179-193
    • Gent, I.1    Prosser, M.E.P.2    Smith, B.3    Walsh, T.4
  • 9
    • 49449120803 scopus 로고
    • Consistency in networks of relations
    • Mackworth, A. (1977). Consistency in Networks of Relations. Artificial Intelligence 8: 99-118.
    • (1977) Artificial Intelligence , vol.8 , pp. 99-118
    • Mackworth, A.1
  • 10
    • 0021828305 scopus 로고
    • The complexity of some polynomial network consistency algorithms for constraint satisfaction problems
    • Mackworth, A. & Preuder, E. (1985). The Complexity of Some Polynomial Network Consistency Algorithms for Constraint Satisfaction Problems. Artificial Intelligence 25(1): 65-73.
    • (1985) Artificial Intelligence , vol.25 , Issue.1 , pp. 65-73
    • Mackworth, A.1    Preuder, E.2
  • 11
    • 0022677637 scopus 로고
    • Arc and path consistency revisited
    • Mohr, R. & Henderson, T. (1986). Arc and Path Consistency Revisited. Artificial Intelligence 28: 225-233.
    • (1986) Artificial Intelligence , vol.28 , pp. 225-233
    • Mohr, R.1    Henderson, T.2
  • 12
  • 16
    • 3843144081 scopus 로고    scopus 로고
    • Lightweight arc-consistency algorithms
    • Cork Constraint Computation Centre
    • van Dongen, M. (2003b). Lightweight Arc-Consistency Algorithms. Technical Report TR-01-2003, Cork Constraint Computation Centre.
    • (2003) Technical Report , vol.TR-01-2003
    • Van Dongen, M.1
  • 17
    • 3843092920 scopus 로고    scopus 로고
    • Lightweight MAC algorithms
    • Cork Constraint Computation Centre
    • van Dongen, M. (2003c). Lightweight MAC Algorithms. Technical Report TR-02-2003, Cork Constraint Computation Centre.
    • (2003) Technical Report , vol.TR-02-2003
    • Van Dongen, M.1
  • 18
    • 0041977610 scopus 로고
    • Ordering heuristics for arc consistency algorithms
    • Vancouver, British Columbia, Canada
    • Wallace, R. & Freuder, E. (1992). Ordering Heuristics for Arc Consistency Algorithms. In AI/GI/VT92, 163-169, Vancouver, British Columbia, Canada.
    • (1992) AI/GI/VT92 , pp. 163-169
    • Wallace, R.1    Freuder, E.2


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