Sciweavers

664 search results - page 11 / 133
» The tree Constraint
Sort
View
ISCAS
2003
IEEE
128views Hardware» more  ISCAS 2003»
15 years 2 months ago
Placement with symmetry constraints for analog layout using red-black trees
– The traditional way of approaching placement problems in computer-aided design (CAD) tools for analog layout is to explore an extremely large search space of feasible or unfeas...
Sarat C. Maruvada, Karthik Krishnamoorthy, Subodh ...
CP
2005
Springer
15 years 3 months ago
Computing and Exploiting Tree-Decompositions for Solving Constraint Networks
Methods exploiting tree-decompositions seem to provide the best approach for solving constraint networks w.r.t. the theoretical time complexity. However, they have not shown a real...
Philippe Jégou, Samba Ndiaye, Cyril Terriou...
69
Voted
ECAI
2004
Springer
15 years 3 months ago
Adversarial Constraint Satisfaction by Game-Tree Search
Many decision problems can be modelled as adversarial constraint satisfaction, which allows us to integrate methods from AI game playing. In particular, by using the idea of oppone...
Kenneth N. Brown, James Little, Páidí...
CP
2011
Springer
13 years 9 months ago
Pseudo-Tree-Based Incomplete Algorithm for Distributed Constraint Optimization with Quality Bounds
A Distributed Constraint Optimization Problem (DCOP) is a fundamental problem that can formalize various applications related to multi-agent cooperation. Since it is NP-hard, consi...
Tenda Okimoto, Yongjoon Joe, Atsushi Iwasaki, Mako...
APPROX
2005
Springer
73views Algorithms» more  APPROX 2005»
15 years 3 months ago
Scheduling on Unrelated Machines Under Tree-Like Precedence Constraints
V. S. Anil Kumar, Madhav V. Marathe, Srinivasan Pa...