Sciweavers

1552 search results - page 298 / 311
» On the Complexity of Constant Propagation
Sort
View
STOC
2010
ACM
185views Algorithms» more  STOC 2010»
15 years 3 months ago
Measuring independence of datasets
Approximating pairwise, or k-wise, independence with sublinear memory is of considerable importance in the data stream model. In the streaming model the joint distribution is give...
Vladimir Braverman, Rafail Ostrovsky
COCO
2010
Springer
198views Algorithms» more  COCO 2010»
15 years 3 months ago
Derandomized Parallel Repetition Theorems for Free Games
—Raz’s parallel repetition theorem [21] together with improvements of Holenstein [12] shows that for any two-prover one-round game with value at most 1 − (for ≤ 1/2), the v...
Ronen Shaltiel
ESA
2006
Springer
137views Algorithms» more  ESA 2006»
15 years 3 months ago
Deciding Relaxed Two-Colorability - A Hardness Jump
A coloring is proper if each color class induces connected components of order one (where the order of a graph is its number of vertices). Here we study relaxations of proper two-c...
Robert Berke, Tibor Szabó
FASE
2006
Springer
15 years 3 months ago
: Designing a Scalable Build Process
Modern software codebases are frequently large, heterogeneous, and constantly evolving. The languages and tools for software construction, including code builds and configuration m...
Jason Hickey, Aleksey Nogin
GECCO
2006
Springer
161views Optimization» more  GECCO 2006»
15 years 3 months ago
An empirical investigation of how and why neutrality affects evolutionary search
The effects of neutrality on evolutionary search have been considered in a number of interesting studies, the results of which, however, have been contradictory. Some researchers ...
Edgar Galván López, Riccardo Poli