14779 search results - page 429 / 2956 » On Ultrametric Algorithmic Information |
175
click to vote
JSSPP
2004
Springer
16 years 7 days ago
2004
Springer
Using a single traditional gang scheduling algorithm cannot provide the best performance for all workloads and parallel architectures. A solution for this problem is the use of...
215
click to vote
AIIA
2003
Springer
16 years 3 days ago
2003
Springer
A bayesian network is an appropriate tool for working with uncertainty and probability, that are typical of real-life applications. In literature we find different approaches for b...
177
click to vote
COMPGEOM
1997
ACM
15 years 11 months ago
1997
ACM
Many algorithms developed in computational geometry are needlessly complicated and slow because they have to be prepared for very complicated, hypothetical inputs. To avoid this, ...
209
click to vote
LION
2010
Springer
15 years 11 months ago
2010
Springer
Abstract. Algorithm selection is typically based on models of algorithm performance learned during a separate offline training sequence, which can be prohibitively expensive. In r...
212
click to vote
CCGRID
2004
IEEE
15 years 10 months ago
2004
IEEE
Recently Peer-to-Peer networks (P2P) have gained great attention and popularity. One key challenging aspect in a P2P resource sharing environment is an efficient searching algorit...