SCOPUS 정보 검색 플랫폼

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1330, Issue , 1997, Pages 182-195

Modelling exceptionally hard constraint satisfaction problems

(2) Smith, Barbara M a Grant, Stuart A a

a UNIVERSITY OF LEEDS (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING; CONSTRAINT THEORY; COST BENEFIT ANALYSIS;

BACKTRACKING ALGORITHM; BINARY CONSTRAINT SATISFACTION; CONSTRAINT GRAPH; COST DISTRIBUTION; HARD CONSTRAINTS; HARD PROBLEMS; SIMILAR MODELS; SYSTEMATIC SEARCH ALGORITHM;

CONSTRAINT SATISFACTION PROBLEMS;

EID: 84948958439 PISSN: 03029743 EISSN: 16113349 Source Type: Book Series
DOI: 10.1007/bfb0017439 Document Type: Conference Paper

Times cited : (21)

References (10)

1
- 0004259164
- Technical report, CIRL, University of Oregon, Feb
- A. B. Baker. Intelligent Backtracking on the Hardest Constraint Problems. Technical report, CIRL, University of Oregon, Feb. 1995.
- (1995) Intelligent Backtracking on the Hardest Constraint Problems
- Baker, A.B.¹

2
- 84957885500
- Using CSP Look-Back Techniques to Solve Exceptionally Hard SAT Instances
- R. J. Bayardo and R. Schrag. Using CSP Look-Back Techniques to Solve Exceptionally Hard SAT Instances. In Proceedings CP96, pages 46-60, 1996.
- (1996) Proceedings CP96 , pp. 46-60
- Bayardo, R.J.¹ Schrag, R.²

3
- 0001580511
- . Where the Really Hard Problems are
- P. Cheeseman, B. Kanefsky, and W. Taylor. Where the Really Hard Problems are. In Proceedings IJCAI-91, volume 1, pages 331-337, 1991.
- (1991) Proceedings IJCAI-91 , vol.1 , pp. 331-337
- Cheeseman, P.¹ Kanefsky, B.² Taylor, W.³

4
- 0028529155
- Easy Problems are Sometimes Hard
- I. P. Gent and T. Walsh. Easy Problems are Sometimes Hard. Artificial Intelligence, 70:335-345, 1994.
- (1994) Artificial Intelligence , vol.70 , pp. 335-345
- Gent, I.P.¹ Walsh, T.²

5
- 0001574321
- Phase Transitions from Real Computational Problems
- Oct
- I. P. Gent and T. Walsh. Phase Transitions from Real Computational Problems. In Proceedings of the 8th International Symposium on Artificial Intelligence, pages 356-364, Oct. 1995.
- (1995) Proceedings of the 8th International Symposium on Artificial Intelligence , pp. 356-364
- Gent, I.P.¹ Walsh, T.²

6
- 0019067870
- Increasing tree search efficiency for constraint satisfaction problems
- R. Haralick and G. Elliott. Increasing tree search efficiency for constraint satisfaction problems. Artificial Intelligence, 14:263-313, 1980.
- (1980) Artificial Intelligence , vol.14 , pp. 263-313
- Haralick, R.¹ Elliott, G.²

7
- 0028499010
- The Hardest Constraint Problems: A Double Phase Transition
- T. Hogg and C. P. Williams. The Hardest Constraint Problems: A Double Phase Transition. Artificial Intelligence, 69:359-377, 1994.
- (1994) Artificial Intelligence , vol.69 , pp. 359-377
- Hogg, T.¹ Williams, C.P.²

8
- 0001372340
- Hybrid Algorithms for the Constraint Satisfaction Problem
- P. 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.¹

9
- 0030107174
- Critical behaviour in the computational cost of satisfiability testing
- B. Selman and S. Kirkpatrick. Critical behaviour in the computational cost of satisfiability testing. Artificial Intelligence, 81:273-295, 1996.
- (1996) Artificial Intelligence , vol.81 , pp. 273-295
- Selman, B.¹ Kirkpatrick, S.²

10
- 0001790190
- Sparse Constraint Graphs and Exceptionally Hard Problems
- B. M. Smith and S. A. Grant. Sparse Constraint Graphs and Exceptionally Hard Problems. In Proceedings IJCAI95, volume 1, pages 646-651, 1995.
- (1995) Proceedings IJCAI95 , vol.1 , pp. 646-651
- Smith, B.M.¹ Grant, S.A.²

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