Sciweavers

12825 search results - page 374 / 2565
» Improved PLSOM algorithm
Sort
View
COCO
2009
Springer
155views Algorithms» more  COCO 2009»
16 years 2 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
APPROX
2011
Springer
234views Algorithms» more  APPROX 2011»
14 years 7 months ago
Streaming Algorithms with One-Sided Estimation
Abstract. We study the space complexity of randomized streaming algorithms that provide one-sided approximation guarantees; e.g., the algorithm always returns an overestimate of th...
Joshua Brody, David P. Woodruff
SIAMCOMP
2012
13 years 9 months ago
Randomized Competitive Algorithms for Generalized Caching
We consider online algorithms for the generalized caching problem. Here we are given a cache of size k and pages with arbitrary sizes and fetching costs. Given a request sequence ...
Nikhil Bansal, Niv Buchbinder, Joseph Naor
CDC
2009
IEEE
129views Control Systems» more  CDC 2009»
15 years 11 months ago
Improving the performance of active set based Model Predictive Controls by dataflow methods
Abstract-- Dataflow representations of Digital Signal Processing (DSP) software have been developing since the 1980's. They have proven to be useful in identifying bottlenecks...
Ruirui Gu, Shuvra S. Bhattacharyya, William S. Lev...
CIG
2006
IEEE
15 years 9 months ago
Improving Artificial Intelligence In a Motocross Game
We have previously investigated the use of artificial neural networks to ride simulated motorbikes in a new computer game. These artificial neural networks were trained using two d...
Benoit Chaperot, Colin Fyfe