Sciweavers

1516 search results - page 47 / 304
» The Increasing Nvalue Constraint
Sort
View
CORR
2004
Springer
151views Education» more  CORR 2004»
14 years 9 months ago
Finite-Tree Analysis for Constraint Logic-Based Languages: The Complete Unabridged Version
Logic languages based on the theory of rational, possibly infinite, trees have much appeal in that rational trees allow for faster unification (due to the safe omission of the occ...
Roberto Bagnara, Roberta Gori, Patricia M. Hill, E...
PPDP
2001
Springer
15 years 2 months ago
When Do Bounds and Domain Propagation Lead to the Same Search Space?
This paper explores the question of when two propagationbased constraint systems have the same behaviour, in terms of search space. We categorise the behaviour of domain and bound...
Christian Schulte, Peter J. Stuckey
CP
2010
Springer
14 years 8 months ago
Exponential Propagation for Set Variables
Research on constraint propagation has primarily focused on designing polynomial-time propagators sometimes at the cost of a weaker filtering. Interestingly, the evolution of cons...
Justin Yip, Pascal Van Hentenryck
ICCAD
2003
IEEE
154views Hardware» more  ICCAD 2003»
15 years 6 months ago
Length-Matching Routing for High-Speed Printed Circuit Boards
As the clock frequencies used in industrial applications increase, the timing requirements imposed on routing problems become tighter. So, it becomes important to route the nets w...
Muhammet Mustafa Ozdal, Martin D. F. Wong
CORR
2010
Springer
69views Education» more  CORR 2010»
14 years 9 months ago
Efficient Knowledge Base Management in DCSP
DCSP (Distributed Constraint Satisfaction Problem) has been a very important research area in AI (Artificial Intelligence). There are many application problems in distributed AI t...
Hong Jiang