1816 search results - page 234 / 364 » A New Approach for Solving the Maximum Clique Problem |
169
click to vote
SIAMJO
2010
15 years 4 months ago
2010
Abstract. We present a new “lifting” approach for the solution of nonlinear optimization problems (NLPs) that have objective and constraint functions with intermediate variable...
179
click to vote
COLT
2008
Springer
15 years 8 months ago
2008
Springer
In the multi-armed bandit (MAB) problem there are k distributions associated with the rewards of playing each of k strategies (slot machine arms). The reward distributions are ini...
128
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
The way a rational agent changes her belief in certain proposition/hypotheses in the light of new evidence lies in the heart of Bayesian inference. The basic natural assumption, a...
203
click to vote
KAIS
2008
15 years 6 months ago
2008
Much work on skewed, stochastic, high dimensional, and biased datasets usually implicitly solve each problem separately. Recently, we have been approached by Texas Commission on En...
205
click to vote
GPEM
2002
15 years 6 months ago
2002
Ant Colony Optimization (ACO) is a metaheuristic used to solve combinatorial optimization problems. As with other metaheuristics, like evolutionary methods, ACO algorithms often sh...