Sciweavers

425 search results - page 2 / 85
» On the additive constant of the k-server Work Function Algor...
Sort
View
ESA
2009
Springer
90views Algorithms» more  ESA 2009»
14 years 1 days ago
Storing a Compressed Function with Constant Time Access
We consider the problem of representing, in a space-efficient way, a function f : S → Σ such that any function value can be computed in constant time on a RAM. Specifically, ou...
Jóhannes B. Hreinsson, Morten Krøyer...
GECCO
2003
Springer
109views Optimization» more  GECCO 2003»
13 years 10 months ago
Real Royal Road Functions for Constant Population Size
Evolutionary and genetic algorithms (EAs and GAs) are quite successful randomized function optimizers. This success is mainly based on the interaction of different operators like ...
Tobias Storch, Ingo Wegener
BIBE
2007
IEEE
134views Bioinformatics» more  BIBE 2007»
13 years 11 months ago
Bottom-Up Multiple Row Addition Algorithms for the Biclustering-Problem
Abstract—The discovery of locally and significantly correlated subpatterns within a two-dimensional dataset has recently become quite popular and is amongst others addressed by ...
Hyung-Won Koh, Lars Hildebrand
ICALP
2007
Springer
13 years 9 months ago
Efficient Algorithms for Constant Well Supported Approximate Equilibria in Bimatrix Games
Abstract. In this work we study the tractability of well supported approximate Nash Equilibria (SuppNE in short) in bimatrix games. In view of the apparent intractability of constr...
Spyros C. Kontogiannis, Paul G. Spirakis
FOCS
1989
IEEE
13 years 9 months ago
Constant Depth Circuits, Fourier Transform, and Learnability
In this paper, Boolean functions in ,4C0 are studied using harmonic analysis on the cube. The main result is that an ACO Boolean function has almost all of its “power spectrum”...
Nathan Linial, Yishay Mansour, Noam Nisan