메뉴 건너뛰기




Volumn 1, Issue , 1999, Pages 436-441

Improving search using indexing: A study with temporal CSPs

Author keywords

[No Author keywords available]

Indexed keywords

DIRECTED SEARCHES; FORWARD CHECKING; SEARCH PERFORMANCE; TEMPORAL DATABASE;

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

References (13)
  • 1
    • 0020849266 scopus 로고
    • Maintaining Knowledge about Temporal Intervals
    • James F. Allen. Maintaining Knowledge about Temporal Intervals. Communications of the ACM 26(12): 832-843, 1983.
    • (1983) Communications of the ACM , vol.26 , Issue.12 , pp. 832-843
    • Allen, J.F.1
  • 3
    • 0024750192 scopus 로고
    • Using temporal hierarchies to efficiently maintain large temporal databases
    • DOI 10.1145/76359.76360
    • Thomas Dean. Using Temporal Hierarchies to Efficiently Maintain Large Temporal Databases. Journal of ACM 36(4): 687-718, 1989. (Pubitemid 20613327)
    • (1989) Journal of the ACM , vol.36 , Issue.4 , pp. 687-718
    • Dean, T.1
  • 4
    • 0028485159 scopus 로고
    • Experimental Evaluation of Preprocessing Algorithms for Constraint Satisfaction Problems
    • Rina Dechter, Itay Meiri. Experimental Evaluation of Preprocessing Algorithms for Constraint Satisfaction Problems. Artificial Intelligence 68(2): 211-241, 1994.
    • (1994) Artificial Intelligence , vol.68 , Issue.2 , pp. 211-241
    • Dechter, R.1    Meiri, I.2
  • 5
    • 0023842374 scopus 로고
    • Network-Based Heuristics for Constraint-Satisfaction Problems
    • Rina Dechtcr, Judea Pearl. Network-Based Heuristics for Constraint-Satisfaction Problems. Artificial Intelligence 34(1): 1-38, 1987.
    • (1987) Artificial Intelligence , vol.34 , Issue.1 , pp. 1-38
    • Dechtcr, R.1    Pearl, J.2
  • 7
    • 0021615874 scopus 로고    scopus 로고
    • R-trees: A Dynamic Index Structure for Spatial Searching
    • Antonin Guttman. R-trees: A Dynamic Index Structure for Spatial Searching. In Proceedings of ACM SIGMOD, 1984.
    • Proceedings of ACM SIGMOD, 1984
    • Guttman, A.1
  • 8
    • 0019067870 scopus 로고
    • Increasing tree search efficiency for constraint satisfaction problems
    • Robert M. Haralick, Gordon L. Elliott. Increasing tree search efficiency for constraint satisfaction problems. Artificial Intelligence 14(3): 263-313, 1980.
    • (1980) Artificial Intelligence , vol.14 , Issue.3 , pp. 263-313
    • Haralick, R.M.1    Elliott, G.L.2
  • 12
    • 0001372340 scopus 로고
    • Hybrid Algorithms for the Constraint Satisfaction Problem
    • Patrick Prosser. Hybrid Algorithms for the Constraint Satisfaction Problem. Computational Intelligence, 9(3): 268-299, 1993.
    • (1993) Computational Intelligence , vol.9 , Issue.3 , pp. 268-299
    • Prosser, P.1
  • 13
    • 0002257189 scopus 로고
    • Reasoning about qualitative temporal information
    • Peter van Beck. Reasoning about qualitative temporal information. Artificial Intelligence 58: 297-324, 1992.
    • (1992) Artificial Intelligence , vol.58 , pp. 297-324
    • Van Beck, P.1


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