메뉴 건너뛰기




Volumn , Issue , 2005, Pages 110-119

On the tractability of restricted disjunctive temporal problems

Author keywords

[No Author keywords available]

Indexed keywords

DETERMINISTIC ALGORITHMS; EXPECTED RUNNING TIME; POLYNOMIAL TIME DETERMINISTIC ALGORITHM; POLYNOMIAL-TIME; POLYNOMIAL-TIME ALGORITHMS; RANDOMIZED ALGORITHMS; TEMPORAL CONSTRAINTS; TEMPORAL REASONING;

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

References (11)
  • 3
    • 0033522706 scopus 로고    scopus 로고
    • Constraint satisfaction over connected row-convex constraints
    • Deville Y., Barette O. and Van Hentenryck P. Constraint Satisfaction over Connected Row-Convex Constraints. Artificial Intelligence, 109(1-2):243-271, 1999.
    • (1999) Artificial Intelligence , vol.109 , Issue.1-2 , pp. 243-271
    • Deville, Y.1    Barette, O.2    Van, H.P.3
  • 11
    • 0242334187 scopus 로고    scopus 로고
    • Efficient solution techniques for disjunctive temporal reasoning problems
    • Tsamardinos I. and Pollack M. E. Efficient Solution Techniques for Disjunctive Temporal Reasoning Problems. Artificial Intelligence, I5I(I-2):43-90, 2003.
    • (2003) Artificial Intelligence , vol.151 , Issue.1-2 , pp. 43-90
    • Tsamardinos, I.1    Pollack, M.E.2


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