Sciweavers

2425 search results - page 430 / 485
» Practical performance models for complex, popular applicatio...
Sort
View
ATAL
2003
Springer
15 years 11 months ago
Information-driven phase changes in multi-agent coordination
Large systems of agents deployed in a real-world environment face threats to their problem solving performance that are independent of the complexity of the problem or the charact...
Sven Brueckner, H. Van Dyke Parunak
ML
2002
ACM
143views Machine Learning» more  ML 2002»
15 years 5 months ago
A Sparse Sampling Algorithm for Near-Optimal Planning in Large Markov Decision Processes
An issue that is critical for the application of Markov decision processes MDPs to realistic problems is how the complexity of planning scales with the size of the MDP. In stochas...
Michael J. Kearns, Yishay Mansour, Andrew Y. Ng
PPOPP
2009
ACM
16 years 6 months ago
An efficient transactional memory algorithm for computing minimum spanning forest of sparse graphs
Due to power wall, memory wall, and ILP wall, we are facing the end of ever increasing single-threaded performance. For this reason, multicore and manycore processors are arising ...
Seunghwa Kang, David A. Bader
FPGA
2008
ACM
136views FPGA» more  FPGA 2008»
15 years 7 months ago
A complexity-effective architecture for accelerating full-system multiprocessor simulations using FPGAs
Functional full-system simulators are powerful and versatile research tools for accelerating architectural exploration and advanced software development. Their main shortcoming is...
Eric S. Chung, Eriko Nurvitadhi, James C. Hoe, Bab...
SAC
2006
ACM
16 years 4 days ago
The impact of sample reduction on PCA-based feature extraction for supervised learning
“The curse of dimensionality” is pertinent to many learning algorithms, and it denotes the drastic raise of computational complexity and classification error in high dimension...
Mykola Pechenizkiy, Seppo Puuronen, Alexey Tsymbal