Sciweavers

5138 search results - page 671 / 1028
» Randomized Algorithms for 3-SAT
Sort
View
GECCO
2010
Springer
154views Optimization» more  GECCO 2010»
15 years 11 months ago
Evolutionary learning in networked multi-agent organizations
This study proposes a simple computational model of evolutionary learning in organizations informed by genetic algorithms. Agents who interact only with neighboring partners seek ...
Jae-Woo Kim
FPGA
2001
ACM
152views FPGA» more  FPGA 2001»
15 years 11 months ago
A pipelined architecture for partitioned DWT based lossy image compression using FPGA's
Discrete wavelet transformations (DWT) followed by embedded zerotree encoding is a very efficient technique for image compression [2, 5, 4]. However, the algorithms proposed in l...
Jörg Ritter, Paul Molitor
STOC
2000
ACM
117views Algorithms» more  STOC 2000»
15 years 11 months ago
Faster suffix tree construction with missing suffix links
Abstract. We consider suffix tree construction for situations with missing suffix links. Two examples of such situations are suffix trees for parameterized strings and suffix trees...
Richard Cole, Ramesh Hariharan
KDD
1998
ACM
120views Data Mining» more  KDD 1998»
15 years 11 months ago
Large Datasets Lead to Overly Complex Models: An Explanation and a Solution
This paper explores unexpected results that lie at the intersection of two common themes in the KDD community: large datasets and the goal of building compact models. Experiments ...
Tim Oates, David Jensen
PODC
1990
ACM
15 years 10 months ago
Sharing Memory Robustly in Message-Passing Systems
Emulators that translate algorithms from the shared-memory model to two different message-passing models are presented. Both are achieved by implementing a wait-free, atomic, singl...
Hagit Attiya, Amotz Bar-Noy, Danny Dolev