963 search results - page 91 / 193 » On Computation of Performance Bounds of Optimal Index Assign... |
IPPS
2006
IEEE
15 years 5 months ago
2006
IEEE
In this paper we consider the map construction problem in the case of an anonymous, unoriented torus of unknown size. An agent that can move from node to neighbouring node in the ...
IWCMC
2009
ACM
15 years 4 months ago
2009
ACM
We consider the problem of scheduling emergency responders to geospatially located finite duration temporally bounded tasks. We consider two different schedulers, Greedy and Mee...
109
click to vote
IPPS
2005
IEEE
15 years 5 months ago
2005
IEEE
Heterogeneous computing systems composed of interconnected machines with varied computational capabilities often operate in environments where there may be sudden machine failures...
111
click to vote
ESA
2009
Springer
15 years 6 months ago
2009
Springer
In this paper we investigate the problem of partitioning an input string T in such a way that compressing individually its parts via a basecompressor C gets a compressed output th...
AINA
2008
IEEE
15 years 6 months ago
2008
IEEE
This paper shows that the performance of peer-to-peer resource discovery algorithms is upper bounded by a k-Steiner minimum tree and proposes an algorithm locating near-optimal qu...