Sciweavers

311 search results - page 20 / 63
» Exploiting Decomposition in Constraint Optimization Problems
Sort
View
ICCV
2011
IEEE
12 years 7 months ago
Tracking Multiple People under Global Appearance Constraints
In this paper, we show that tracking multiple people whose paths may intersect can be formulated as a convex global optimization problem. Our proposed framework is designed to exp...
Horesh Ben Shitrit, Jerome Berclaz, Francois Fleur...
AAAI
2011
12 years 7 months ago
Recommendation Sets and Choice Queries: There Is No Exploration/Exploitation Tradeoff!
Utility elicitation is an important component of many applications, such as decision support systems and recommender systems. Such systems query users about their preferences and ...
Paolo Viappiani, Craig Boutilier
WEA
2010
Springer
289views Algorithms» more  WEA 2010»
14 years 2 months ago
Experiments with a Generic Dantzig-Wolfe Decomposition for Integer Programs
Abstract We report on experiments with turning the branch-price-andcut framework SCIP into a generic branch-price-and-cut solver. That is, given a mixed integer program (MIP), our ...
Gerald Gamrath, Marco E. Lübbecke
GLOBECOM
2008
IEEE
14 years 2 months ago
Distributed Base Station Cooperation via Block-Diagonalization and Dual-Decomposition
Abstract—It has been recently shown that base station cooperation may yield great capacity improvement in downlink multiple antenna cellular networks. However, the proposed solut...
Yosia Hadisusanto, Lars Thiele, Volker Jungnickel
CP
2008
Springer
13 years 9 months ago
An Application of Constraint Programming to Superblock Instruction Scheduling
Modern computer architectures have complex features that can only be fully taken advantage of if the compiler schedules the compiled code. A standard region of code for scheduling ...
Abid M. Malik, Michael Chase, Tyrel Russell, Peter...