2109 search results - page 189 / 422 » Solving Necklace Constraint Problems |
153
click to vote
CPAIOR
2007
Springer
16 years 19 days ago
2007
Springer
Abstract. In this paper, we introduce a Yet ImprovEd Limited Discrepancy Search (YIELDS), a complete algorithm for solving Constraint Satisfaction Problems. As indicated in its nam...
159
click to vote
GFKL
2007
Springer
16 years 19 days ago
2007
Springer
Abstract. A central task when integrating data from different sources is to detect identical items. For example, price comparison websites have to identify offers for identical p...
183
click to vote
IJCAI
1989
15 years 7 months ago
1989
Cognitive architectures aspire for generality both in terms of problem solving and learning across a range of problems, yet to date few examples of domain independent learning has...
183
click to vote
CONSTRAINTS
2007
15 years 6 months ago
2007
The graph set T-colouring problem (GSTCP) generalises the classical graph colouring problem; it asks for the assignment of sets of integers to the vertices of a graph such that co...
183
click to vote
ISQED
2002
IEEE
15 years 11 months ago
2002
IEEE
This paper presents a fast algorithm to optimize both the widths and lengths of power/ground networks under reliability and power dip/ground bounce constraints. The spacesizing wh...