1480 search results - page 168 / 296 » Ants can solve constraint satisfaction problems |
138
click to vote
SIAMJO
2008
15 years 6 months ago
2008
This paper presents a parameter-free integer-programming based algorithm for the global resolution of a linear program with linear complementarity constraints (LPCC). The cornersto...
187
click to vote
DEDS
2010
15 years 3 months ago
2010
We consider Discrete Event Systems (DES) involving tasks with real-time constraints and seek to control processing times so as to minimize a cost function subject to each task mee...
160
click to vote
ICCV
2011
IEEE
14 years 6 months ago
2011
IEEE
We propose a novel framework for imposing label ordering constraints in multilabel optimization. In particular, label jumps can be penalized differently depending on the jump dire...
190
click to vote
OL
2007
15 years 6 months ago
2007
We propose an SQP-type algorithm for solving nonlinear second-order cone programming (NSOCP) problems. At every iteration, the algorithm solves a convex SOCP subproblem in which th...
196
click to vote
INFOCOM
2012
IEEE
13 years 9 months ago
2012
IEEE
—Cognitive Radio Networks allow unlicensed users to opportunistically access the licensed spectrum without causing disruptive interference to the primary users (PUs). One of the ...