406 search results - page 27 / 82 » Gadgets, Approximation, and Linear Programming |
128
Voted
FOCS
2005
IEEE
15 years 9 months ago
2005
IEEE
We present a polynomial time algorithm based on semidefinite programming that, given a unique game of value 1 − O(1/ log n), satisfies a constant fraction of constraints, wher...
120
Voted
CDC
2009
IEEE
15 years 8 months ago
2009
IEEE
— The task in control allocation is to determine how to generate a specified generalized force from a redundant set of control effectors where the associated actuator control in...
138
Voted
IFIP
2005
Springer
15 years 9 months ago
2005
Springer
Two different approaches are proposed to enhance the efficiency of the numerical resolution of optimal control problems governed by a linear advection– diffusion equation. In ...
149
click to vote
ENDM
2010
15 years 3 months ago
2010
Abstract We study the version of the asymmetric prize collecting traveling salesman problem, where the objective is to find a directed tour that visits a subset of vertices such th...
160
Voted
HEURISTICS
1998
15 years 3 months ago
1998
We consider the maximum covering problem, a combinatorial optimization problem that arises in many facility location problems. In this problem, a potential facility site covers a s...