14th IEEE International Conference on Tools With Artificial Intelligence, 2002. (ICTAI 2002). Proceedings.
DOI: 10.1109/tai.2002.1180792
|View full text |Cite
|
Sign up to set email alerts
|

A lazy divide and conquer approach to constraint solving

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(1 citation statement)
references
References 10 publications
0
1
0
Order By: Relevance
“…Divide and conquer approach causes additional computations for each sub-problem due to its recursive nature. In [ 4 ], a backtracking algorithm is used to overcome these additional computations. All sub-problems are solved recursively via backtracking and solutions are then combined until global constraint is fulfilled.…”
Section: Introductionmentioning
confidence: 99%
“…Divide and conquer approach causes additional computations for each sub-problem due to its recursive nature. In [ 4 ], a backtracking algorithm is used to overcome these additional computations. All sub-problems are solved recursively via backtracking and solutions are then combined until global constraint is fulfilled.…”
Section: Introductionmentioning
confidence: 99%