Sciweavers

291 search results - page 1 / 59
» How Well Can Primal-Dual and Local-Ratio Algorithms Perform
Sort
View
ICALP
2005
Springer
14 years 4 months ago
How Well Can Primal-Dual and Local-Ratio Algorithms Perform?
We define an algorithmic paradigm, the stack model, that captures many primal-dual and local-ratio algorithms for approximating covering and packing problems. The stack model is ...
Allan Borodin, David Cashman, Avner Magen
INFOCOM
2008
IEEE
14 years 5 months ago
Joint Scheduling and Congestion Control in Mobile Ad-Hoc Networks
— In this paper we study the problem of jointly performing scheduling and congestion control in mobile adhoc networks so that network queues remain bounded and the resulting flo...
Umut Akyol, Matthew Andrews, Piyush Gupta, John D....
GECCO
2007
Springer
183views Optimization» more  GECCO 2007»
14 years 4 months ago
Distribution replacement: how survival of the worst can out perform survival of the fittest
A new family of "Distribution Replacement” operators for use in steady state genetic algorithms is presented. Distribution replacement enforces the members of the populatio...
Howard Tripp, Phil Palmer
3DPVT
2006
IEEE
162views Visualization» more  3DPVT 2006»
14 years 4 months ago
How Far Can We Go with Local Optimization in Real-Time Stereo Matching
Applications such as robot navigation and augmented reality require high-accuracy dense disparity maps in real-time and online. Due to time constraint, most realtime stereo applic...
Liang Wang, Mingwei Gong, Minglun Gong, Ruigang Ya...
COMPGEOM
1995
ACM
14 years 2 months ago
How Good are Convex Hull Algorithms?
A convex polytope P can be speci ed in two ways: as the convex hull of the vertex set V of P, or as the intersection of the set H of its facet-inducing halfspaces. The vertex enum...
David Avis, David Bremner