1434 search results - page 151 / 287 » Distributed Computing with Imperfect Randomness |
142
click to vote
CLUSTER
2002
IEEE
15 years 2 months ago
2002
IEEE
Abstract. We describe and evaluate the Running Time Advisor (RTA), a system that can predict the running time of a compute-bound task on a typical shared, unreserved commodity host...
128
Voted
ICCV
2003
IEEE
16 years 4 months ago
2003
IEEE
In this paper we use the cumulative distribution of a random variable to define the information content in it and use it to develop a novel measure of information that parallels S...
102
click to vote
ATAL
2009
Springer
15 years 8 months ago
2009
Springer
Self-organising multi-agent systems provide a suitable paradigm for developing autonomic computing systems that manage themselves. Towards this goal, we demonstrate a robust, dece...
99
Voted
CG
2010
Springer
15 years 8 days ago
2010
Springer
We used in the past a lot of computational power and human expertise for having a very big dataset of good 9x9 Go games, in order to build an opening book. We improved a lot the al...
131
click to vote
IPL
2006
15 years 2 months ago
2006
The strongest well-known measure for the quality of a universal hash-function family H is its being -strongly universal, which measures, for randomly chosen h H, one's inabi...