11129 search results - page 1872 / 2226 » Modeling Search Computing Applications |
198
click to vote
SPAA
1994
ACM
15 years 11 months ago
1994
ACM
We analyze the performance of greedy routing for array networks by providing bounds on the average delay and the average number of packets in the system for the dynamic routing pr...
167
click to vote
APGV
2007
ACM
15 years 10 months ago
2007
ACM
The display of space filling data is still a challenge for the community of visualization. Direct Volume Rendering (DVR) is one of the most important techniques developed to achie...
161
click to vote
EENERGY
2010
15 years 10 months ago
2010
Sleeping is an important method to reduce energy consumption in many information and communication systems. In this paper we focus on a typical server under dynamic load, where en...
177
click to vote
CIE
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. In this paper, we survey a few recent applications of Kolmogorov complexity to lower bounds in several models of computation. We consider KI complexity of Boolean functio...
222
click to vote
COORDINATION
2006
Springer
15 years 10 months ago
2006
Springer
Mobile ad hoc networks (MANETs) define a challenging computing scenario where access to resources is restrained by connectivity among hosts. Replication offers an opportunity to in...