Sciweavers

270 search results - page 40 / 54
» Constraint relaxation in approximate linear programs
Sort
View
SIAMJO
2002
77views more  SIAMJO 2002»
13 years 7 months ago
Modifying SQP for Degenerate Problems
Most local convergence analyses of the sequential quadratic programming (SQP) algorithm for nonlinear programming make strong assumptions about the solution, namely, that the activ...
Stephen J. Wright
COR
2010
123views more  COR 2010»
13 years 7 months ago
Decomposition, reformulation, and diving in university course timetabling
In many real-life optimisation problems, there are multiple interacting components in a solution. For example, different components might specify assignments to different kinds of...
Edmund K. Burke, Jakub Marecek, Andrew J. Parkes, ...
SODA
2008
ACM
100views Algorithms» more  SODA 2008»
13 years 8 months ago
On allocations that maximize fairness
We consider a problem known as the restricted assignment version of the max-min allocation problem with indivisible goods. There are n items of various nonnegative values and m pl...
Uriel Feige
PIMRC
2008
IEEE
14 years 1 months ago
An optimization framework for the joint routing and scheduling in Wireless Mesh Networks
—In this paper, we address the problem of computing the transport capacity of Wireless Mesh Networks dedicated to Internet access. Routing and transmission scheduling have a majo...
Christelle Molle, Fabrice Peix, Hervé Rivan...
CVPR
2008
IEEE
14 years 9 months ago
Global pose estimation using non-tree models
We propose a novel global pose estimation method to detect body parts of articulated objects in images based on non-tree graph models. There are two kinds of edges defined in the ...
Hao Jiang, David R. Martin