Sciweavers

2354 search results - page 225 / 471
» Assignment Problems
Sort
View
CORR
2006
Springer
150views Education» more  CORR 2006»
15 years 6 months ago
The approximability of MAX CSP with fixed-value constraints
In the maximum constraint satisfaction problem (Max CSP), one is given a finite collection of (possibly weighted) constraints on overlapping sets of variables, and the goal is to ...
Vladimir G. Deineko, Peter Jonsson, Mikael Klasson...
UAI
2004
15 years 7 months ago
Annealed MAP
Maximum a Posteriori assignment (MAP) is the problem of finding the most probable instantiation of a set of variables given the partial evidence on the other variables in a Bayesi...
Changhe Yuan, Tsai-Ching Lu, Marek J. Druzdzel
188
Voted
CVPR
2012
IEEE
13 years 9 months ago
Discrete-continuous optimization for multi-target tracking
The problem of multi-target tracking is comprised of two distinct, but tightly coupled challenges: (i) the naturally discrete problem of data association, i.e. assigning image obs...
Anton Andriyenko, Konrad Schindler, Stefan Roth
NETWORKS
2010
15 years 4 months ago
A branch-and-cut algorithm for partition coloring
Let G = (V, E, Q) be a undirected graph, where V is the set of vertices, E is the set of edges, and Q = {Q1, . . . , Qq} is a partition of V into q subsets. We refer to Q1, . . . ...
Yuri Frota, Nelson Maculan, Thiago F. Noronha, Cel...
173
Voted
ESA
2009
Springer
149views Algorithms» more  ESA 2009»
16 years 1 months ago
Approximability of OFDMA Scheduling
In this paper, we study the complexity and approximability of the orthogonal frequency-division multiple access (OFDMA) scheduling problem with uniformly related communication chan...
Marcel Ochel, Berthold Vöcking