7006 search results - page 459 / 1402 » Approximation Algorithms |
184
Voted
STACS
2010
Springer
16 years 1 months ago
2010
Springer
We revisit several maximization problems for geometric networks design under the non-crossing constraint, first studied by Alon, Rajagopalan and Suri (ACM Symposium on Computation...
138
click to vote
CORR
2008
Springer
15 years 7 months ago
2008
Springer
The floating-point implementation of a function often reduces to a polynomial approximation on an interval. Remez algorithm provides the polynomial closest to the function, but th...
195
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...
200
Voted
SPAA
1998
ACM
15 years 10 months ago
1998
ACM
In this paper we develop models for and analyze several randomized work stealing algorithms in a dynamic setting. Our models represent the limiting behavior of systems as the numb...
161
Voted
GLOBECOM
2006
IEEE
16 years 28 days ago
2006
IEEE
— We address the problem of connection preemption in a multi-class network environment. Our objective is: i) to minimize the number of preempted connections, and ii) to minimize ...