412 search results - page 50 / 83 » Algorithmic Complexity Bounds on Future Prediction Errors |
104
click to vote
ARCS
2009
Springer
15 years 6 months ago
2009
Springer
Abstract. Java is widely deployed on a variety of processor architectures. Consequently, an understanding of microarchitecture level Java performance is critical to optimize curren...
SIGCOMM
2012
ACM
13 years 2 months ago
2012
ACM
We present a methodology that brings simplicity to large and comt labs by using abstraction. The networking community has appreciated the value of large scale test labs to explore...
GECCO
2010
Springer
15 years 4 months ago
2010
Springer
The Spidergon interconnection network has become popular recently in multiprocessor systems on chips. To the best of our knowledge, algorithms for collective communications (CC) h...
TCS
2008
14 years 11 months ago
2008
We introduce a new problem that was motivated by a (more complicated) problem arising in a robotized assembly environment. The bin coloring problem is to pack unit size colored it...
101
click to vote
PAA
2002
14 years 11 months ago
2002
: The idea of performing model combination, instead of model selection, has a long theoretical background in statistics. However, making use of theoretical results is ordinarily su...