592 search results - page 65 / 119 » Using Constraint Programming to Solve the Maximum Clique Pro... |
136
click to vote
CEC
2009
IEEE
15 years 9 months ago
2009
IEEE
— In this paper, the performance assessment of the hybrid Archive-based Micro Genetic Algorithm (AMGA) on a set of bound-constrained synthetic test problems is reported. The hybr...
165
click to vote
JMLR
2010
14 years 10 months ago
2010
We propose to solve the combinatorial problem of finding the highest scoring Bayesian network structure from data. This structure learning problem can be viewed as an inference pr...
124
click to vote
ECAI
2004
Springer
15 years 8 months ago
2004
Springer
Super solutions are a mechanism to provide robustness to constraint programs [10]. They are solutions in which, if a small number of variables lose their values, we are guaranteed ...
110
click to vote
DAC
2005
ACM
16 years 4 months ago
2005
ACM
Power minimization under variability is formulated as a rigorous statistical robust optimization program with a guarantee of power and timing yields. Both power and timing metrics...
144
click to vote
CASES
2007
ACM
15 years 7 months ago
2007
ACM
We derive analytically, the performance optimal throttling curve for a processor under thermal constraints for a given task sequence. We found that keeping the chip temperature co...