Sciweavers

658 search results - page 92 / 132
» Partially Ordered Constraint Optimization Problems
Sort
View
AAAI
2007
15 years 1 days ago
Search Space Reduction and Russian Doll Search
In a constraint optimization problem (COP), many feasible valuations lead to the same objective value. This often means a huge search space and poor performance in the propagation...
Kenil C. K. Cheng, Roland H. C. Yap
ESA
2008
Springer
115views Algorithms» more  ESA 2008»
14 years 11 months ago
A New Approach to Exact Crossing Minimization
The crossing number problem is to find the smallest number of edge crossings necessary when drawing a graph into the plane. Eventhough the problem is NP-hard, we are interested in ...
Markus Chimani, Petra Mutzel, Immanuel M. Bomze
DSD
2005
IEEE
106views Hardware» more  DSD 2005»
15 years 3 months ago
Power-Constrained Hybrid BIST Test Scheduling in an Abort-on-First-Fail Test Environment
1 This paper presents a method for power-constrained system-on-chip test scheduling in an abort-on-first-fail environment where the test is terminated as soon as a fault is detecte...
Zhiyuan He, Gert Jervan, Zebo Peng, Petru Eles
ISCAS
2003
IEEE
119views Hardware» more  ISCAS 2003»
15 years 3 months ago
Simulated evolution algorithm for multiobjective VLSI netlist bi-partitioning
In this paper, the Simulated Evolution algorithm (SimE) is engineered to solve the optimization problem of multi-objective VLSI netlist bi-partitioning. The multi-objective versio...
Sadiq M. Sait, Aiman H. El-Maleh, Rush H. Al-Abuji
ATAL
2008
Springer
14 years 11 months ago
BnB-ADOPT: an asynchronous branch-and-bound DCOP algorithm
Distributed constraint optimization problems (DCOPs) are a popular way of formulating and solving agent-coordination problems. It is often desirable to solve DCOPs optimally with m...
William Yeoh, Ariel Felner, Sven Koenig