Sciweavers

104 search results - page 13 / 21
» Tree Automata with Global Constraints
Sort
View
JAIR
2006
102views more  JAIR 2006»
13 years 7 months ago
Set Intersection and Consistency in Constraint Networks
In this paper, we show that there is a close relation between consistency in a constraint network and set intersection. A proof schema is provided as a generic way to obtain consi...
Yuanlin Zhang, Roland H. C. Yap
IEEESCC
2005
IEEE
14 years 1 months ago
Web Services Composition: A Story of Models, Automata, and Logics
eal world”, represented abstractly using (time-varying) first-order logic predicates and terms. A representative composition result [11] here uses a translation into Petri nets. ...
Richard Hull
AUSAI
2006
Springer
13 years 11 months ago
Finite Domain Bounds Consistency Revisited
A widely adopted approach to solving constraint satisfaction problems combines systematic tree search with constraint propagation for pruning the search space. Constraint propagati...
Chiu Wo Choi, Warwick Harvey, J. H. M. Lee, Peter ...
IJCAI
2003
13 years 9 months ago
Consistency and Set Intersection
We propose a new framework to study properties of consistency in a Constraint Network from the perspective of properties of set intersection. Our framework comes with a proof sche...
Yuanlin Zhang, Roland H. C. Yap
GLVLSI
1996
IEEE
125views VLSI» more  GLVLSI 1996»
13 years 11 months ago
Performance-Driven Interconnect Global Routing
In this paper, we propose a global routing algorithm for multi-layer building-block layouts. The algorithm is based on successive ripup and rerouting while satisfying edge capacit...
Dongsheng Wang, Ernest S. Kuh