Sciweavers

4342 search results - page 281 / 869
» Improved Algorithms for Optimal Embeddings
Sort
View
ATAL
2005
Springer
16 years 7 days ago
Improving reinforcement learning function approximators via neuroevolution
Reinforcement learning problems are commonly tackled with temporal difference methods, which use dynamic programming and statistical sampling to estimate the long-term value of ta...
Shimon Whiteson
IPM
2011
71views more  IPM 2011»
14 years 10 months ago
Improving semistatic compression via phrase-based modeling
In recent years, new semistatic word-based byte-oriented text compressors, such as Tagged Huffman and those based on Dense Codes, have shown that it is possible to perform fast d...
Nieves R. Brisaboa, Antonio Fariña, Gonzalo...
IPPS
1997
IEEE
15 years 11 months ago
Performance Analysis and Optimization on a Parallel Atmospheric General Circulation Model Code
An analysis is presented of the primary factors influencing the performance of a parallel implementation of the UCLA atmospheric general circulation model (AGCM) on distributedme...
John Z. Lou, John D. Farrara
179
Voted
ICIP
2000
IEEE
16 years 8 months ago
Dynamic Memory Model Based Optimization of Scalar and Vector Quantizer for Fast Image Encoding
The rapid progress of computers and today's heterogeneous computing environment means computation-intensive signal processing algorithms must be optimized for performance in ...
Gene Cheung, Steven McCanne
COCO
2003
Springer
162views Algorithms» more  COCO 2003»
15 years 12 months ago
Near-Optimal Lower Bounds on the Multi-Party Communication Complexity of Set Disjointness
We study the communication complexity of the set disjointness problem in the general multi-party model. For t players, each holding a subset of a universe of size n, we establish ...
Amit Chakrabarti, Subhash Khot, Xiaodong Sun