2588 search results - page 242 / 518 » Applications of Kolmogorov complexity to computable model th... |
180
click to vote
ICASSP
2011
IEEE
14 years 10 months ago
2011
IEEE
Traditional binary hypothesis testing relies on the precise knowledge of the probability density of an observed random vector conditioned on each hypothesis. However, for many app...
148
click to vote
IPPS
2008
IEEE
16 years 1 months ago
2008
IEEE
A file data model for algorithmic skeletons is proposed, focusing on transparency and efficiency. Algorithmic skeletons correspond to a high-level programming model that takes a...
178
click to vote
IPPS
2006
IEEE
16 years 20 days ago
2006
IEEE
This paper deals with scheduling divisible load applications on star networks, in presence of return messages. This work is a follow-on of [6, 7], where the same problem was consi...
147
click to vote
ICPPW
2005
IEEE
16 years 7 days ago
2005
IEEE
Large–scale parallel applications performing global synchronization may spend a significant amount of execution time waiting for the completion of a barrier operation. Conseque...
185
click to vote
CORR
2004
Springer
15 years 6 months ago
2004
Springer
Autonomic computing has been proposed recently as a way to address the difficult management of applications whose complexity is constantly increasing. Autonomous applications will ...