178 search results - page 8 / 36 » Bounds, Heuristics, and Approximations for Distribution Syst... |
ISCA
2002
IEEE
13 years 7 months ago
2002
IEEE
In this paper, we consider the tree task graphs which arise from many important programming paradigms such as divide and conquer, branch and bound etc., and the linear task-graphs...
SPAA
2004
ACM
14 years 1 months ago
2004
ACM
Given a general graph G, a fundamental problem is to find a spanning tree H that best approximates G by some measure. Often this measure is some combination of the congestion and...
ATAL
2008
Springer
13 years 9 months ago
2008
Springer
When exploring a game over a large strategy space, it may not be feasible or cost-effective to evaluate the payoff of every relevant strategy profile. For example, determining a p...
ICNP
2007
IEEE
14 years 1 months ago
2007
IEEE
Abstract—Radio frequency identification (RFID) is a technology where a reader device can “sense” the presence of a closeby object by reading a tag device attached to the obj...
SSS
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. For large distributed systems built from inexpensive components, one expects to see incessant failures. This paper proposes two models for such faults and analyzes two we...