698 search results - page 34 / 140 » A Deterministic Algorithm for Solving Imprecise Decision Pro... |
CEC
2008
IEEE
14 years 3 months ago
2008
IEEE
— Many deterministic algorithms in the context of constrained optimization require the first-order derivatives, or the gradient vectors, of the objective and constraint function...
DAC
2005
ACM
14 years 10 months ago
2005
ACM
SAT (Boolean satisfiability) has become the primary Boolean reasoning engine for many EDA applications, so the efficiency of SAT solving is of great practical importance. Recently...
CORR
2010
Springer
13 years 9 months ago
2010
Springer
This paper presents an evaluation of the design decisions made in four state-of-the-art constraint solvers; Choco, ECLiPSe, Gecode, and Minion. To assess the impact of design deci...
EGC
2005
Springer
14 years 2 months ago
2005
Springer
Abstract. Decision making in engineering design can be effectively addressed by using genetic algorithms to solve multi-objective problems. These multi-objective genetic algorithm...
DCC
2002
IEEE
14 years 9 months ago
2002
IEEE
We show that the problem of optimal bit allocation among a set of independent discrete quantizers given a budget constraint is equivalent to the multiple choice knapsack problem (...