Sciweavers

7930 search results - page 498 / 1586
» Greedy in Approximation Algorithms
Sort
View
STOC
1991
ACM
84views Algorithms» more  STOC 1991»
15 years 10 months ago
Self-Testing/Correcting for Polynomials and for Approximate Functions
The study of self-testing/correcting programs was introduced in [8] in order to allow one to use program P to compute function f without trusting that P works correctly. A self-te...
Peter Gemmell, Richard J. Lipton, Ronitt Rubinfeld...
GECCO
2010
Springer
211views Optimization» more  GECCO 2010»
15 years 8 months ago
Investigating EA solutions for approximate KKT conditions in smooth problems
Evolutionary algorithms (EAs) are increasingly being applied to solve real-parameter optimization problems due to their flexibility in handling complexities such as non-convexity,...
Rupesh Tulshyan, Ramnik Arora, Kalyanmoy Deb, Joyd...
SODA
2001
ACM
103views Algorithms» more  SODA 2001»
15 years 8 months ago
Dynamic skin triangulation
This paper describes an algorithm for maintaining an approximating triangulation of a deforming surface in
Ho-Lun Cheng, Tamal K. Dey, Herbert Edelsbrunner, ...
JUCS
2008
151views more  JUCS 2008»
15 years 7 months ago
Bloch's Constant is Computable
: We prove the computability of Bloch's constant by presenting the first algorithm approximating the constant up to arbitrary precision. Key Words: computability, algorithm, B...
Robert Rettinger
ICC
2007
IEEE
127views Communications» more  ICC 2007»
15 years 10 months ago
Spectral Efficiency of Channel-Aware Schedulers in Non-Identical Composite Links with Interference
Accurate system planning and performance evaluation requires knowledge of the joint impact of scheduling, interference, and fading. However, current analyses either require costly...
Jingxian Wu, Neelesh B. Mehta, Andreas F. Molisch,...