851 search results - page 27 / 171 » An exact algorithm for solving the vertex separator problem |
155
Voted
ICCAD
1997
IEEE
15 years 7 months ago
1997
IEEE
We introduce a new technique to solve exactly a discrete optimization problem, based on the paradigm of “negative” thinking. The motivation is that when searching the space of...
113
Voted
IJAR
2006
15 years 3 months ago
2006
Although influence diagrams are powerful tools for representing and solving complex decisionmaking problems, their evaluation may require an enormous computational effort and this...
125
Voted
PDCAT
2005
Springer
15 years 9 months ago
2005
Springer
Fault tolerant algorithms are often designed under the t-out-of-n assumption, which is based on the assumption that all processes or components fail independently with equal proba...
176
Voted
AI
2005
Springer
15 years 3 months ago
2005
Springer
Maximum Boolean satisfiability (max-SAT) is the optimization counterpart of Boolean satisfiability (SAT), in which a variable assignment is sought to satisfy the maximum number of...
140
Voted
PPSN
2010
Springer
15 years 2 months ago
2010
Springer
Solutions calculated by Evolutionary Algorithms have come to surpass exact methods for solving various problems. The Rubik’s Cube multiobjective optimization problem is one such ...