Sciweavers

8824 search results - page 1680 / 1765
» On the Complexity of Real Functions
Sort
View
181
Voted
COCO
2009
Springer
155views Algorithms» more  COCO 2009»
15 years 11 months ago
Weak Derandomization of Weak Algorithms: Explicit Versions of Yao's Lemma
—A simple averaging argument shows that given a randomized algorithm A and a function f such that for every input x, Pr[A(x) = f(x)] ≥ 1−ρ (where the probability is over the...
Ronen Shaltiel
ESA
2009
Springer
149views Algorithms» more  ESA 2009»
15 years 11 months ago
Approximability of OFDMA Scheduling
In this paper, we study the complexity and approximability of the orthogonal frequency-division multiple access (OFDMA) scheduling problem with uniformly related communication chan...
Marcel Ochel, Berthold Vöcking
GECCO
2009
Springer
15 years 11 months ago
On the performance effects of unbiased module encapsulation
A recent theoretical investigation of modular representations shows that certain modularizations can introduce a distance bias into a landscape. This was a static analysis, and em...
R. Paul Wiegand, Gautham Anil, Ivan I. Garibay, Oz...
KSEM
2009
Springer
15 years 11 months ago
A Competitive Learning Approach to Instance Selection for Support Vector Machines
Abstract. Support Vector Machines (SVM) have been applied successfully in a wide variety of fields in the last decade. The SVM problem is formulated as a convex objective function...
Mario Zechner, Michael Granitzer
140
Voted
SEMWEB
2009
Springer
15 years 11 months ago
Results of GeRoMeSuite for OAEI 2009
GeRoMeSuite is a generic model management system which provides several functions for managing complex data models, such as schema integration, definition and execution of schema ...
Christoph Quix, Sandra Geisler, David Kensche, Xia...
« Prev « First page 1680 / 1765 Last » Next »