658 search results - page 92 / 132 » Partially Ordered Constraint Optimization Problems |
156
click to vote
AAAI
2007
15 years 8 months ago
2007
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...
157
click to vote
ESA
2008
Springer
15 years 7 months ago
2008
Springer
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 ...
168
click to vote
DSD
2005
IEEE
15 years 11 months ago
2005
IEEE
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...
141
click to vote
ISCAS
2003
IEEE
15 years 11 months ago
2003
IEEE
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...
148
click to vote
ATAL
2008
Springer
15 years 8 months ago
2008
Springer
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...