151 search results - page 3 / 31 » The max quasi-independent set Problem |
ANOR
2011
12 years 9 months ago
2011
The challenge of maximizing the diversity of a collection of points arises in a variety of settings, including the setting of search methods for hard optimization problems. One ver...
EVOW
2004
Springer
13 years 11 months ago
2004
Springer
This paper introduces a new social metaheuristic for the Max-Cut problem applied to a weighted undirected graph. This problem consists in finding a partition of the nodes into two ...
JSAT
2008
13 years 6 months ago
2008
In this technical report we briefly describe the instances submitted to the 2006 and 2007 MaxSAT Evaluations. First, we introduce the instances that can be directly encoded as Max...
CP
2006
Springer
13 years 10 months ago
2006
Springer
The max k-armed bandit problem is a recently-introduced online optimization problem with practical applications to heuristic search. Given a set of k slot machines, each yielding p...
AAAI
2006
13 years 7 months ago
2006
We present an asymptotically optimal algorithm for the max variant of the k-armed bandit problem. Given a set of k slot machines, each yielding payoff from a fixed (but unknown) d...