2109 search results - page 185 / 422 » Solving Necklace Constraint Problems |
142
click to vote
BCSHCI
2007
15 years 8 months ago
2007
The Creative Problem-Solving Research Group (CPSRG) at Lancaster University is a collaboration between psychologists and computer scientists conducting research into creativity, p...
208
click to vote
TSP
2011
15 years 1 months ago
2011
—This paper deals with the problem of estimating the steering direction of a signal, embedded in Gaussian disturbance, under a general quadratic inequality constraint, representi...
176
click to vote
CCO
2001
Springer
15 years 11 months ago
2001
Springer
Lagrangian relaxation is commonly used in combinatorial optimization to generate lower bounds for a minimization problem. We propose a modified Lagrangian relaxation which used i...
186
click to vote
CORR
2002
Springer
15 years 6 months ago
2002
Springer
We describe sequential and parallel algorithms that approximately solve linear programs with no negative coefficients (a.k.a. mixed packing and covering problems). For explicitly ...
166
click to vote
JSAC
2010
15 years 1 months ago
2010
Abstract--In this paper, we formulate a flow control optimization problem for wireless sensor networks with lifetime constraint and link interference in an asynchronous setting. Ou...