6110 search results - page 1029 / 1222 » Approximate Computing |
165
click to vote
ICALP
2003
Springer
15 years 11 months ago
2003
Springer
We consider requests for capacity in a given tree network T = (V, E) where each edge of the tree has some integer capacity ue. Each request consists of an integer demand df and a ...
174
click to vote
ICCS
2003
Springer
15 years 11 months ago
2003
Springer
Memory traces record the addresses touched by a program during its execution, enabling many useful investigations for understanding and predicting program performance. But complete...
174
click to vote
TAMC
2010
Springer
15 years 11 months ago
2010
Springer
In this paper, we establish the definition of community fundamentally different from what was commonly accepted in previous studies, where communities were typically assumed to ...
177
click to vote
ICPP
2002
IEEE
15 years 11 months ago
2002
IEEE
A cost-effective approach to building up scalable Videoon-Demand (VoD) servers is to couple a number of VoD servers together in a cluster. In this article, we study a crucial vide...
158
click to vote
ICPPW
2002
IEEE
15 years 11 months ago
2002
IEEE
In this paper a multiple routing path problem in wide area Wavelength Division Multiplexing (WDM) networks is considered, which is to find K edge-disjoint lightpaths/semilightpat...