524 search results - page 104 / 105 » An Optimal Lower Bound on the Communication Complexity of Ga... |
IPPS
2007
IEEE
13 years 11 months ago
2007
IEEE
Replicating data objects onto servers across a system can alleviate access delays. The selection of data objects and servers requires solving a constraint optimization problem, wh...
SPAA
2005
ACM
13 years 11 months ago
2005
ACM
We study the admission control problem in general networks. Communication requests arrive over time, and the online algorithm accepts or rejects each request while maintaining the...
ICDT
2010
ACM
13 years 10 months ago
2010
ACM
The paper formulates and investigates the aggregation problem for synthesized mediators of Web services (SWMs). An SWM is a finite-state transducer defined in terms of templates...
INFOCOM
2003
IEEE
13 years 10 months ago
2003
IEEE
Abstract— We explore the problem of routing bandwidth guaranteed paths in wavelength-routed, WDM optical mesh networks. A WDM mesh network offers great flexibility in dynamicall...
VISUALIZATION
2005
IEEE
13 years 11 months ago
2005
IEEE
Existing parallel or remote rendering solutions rely on communicating pixels, OpenGL commands, scene-graph changes or application-specific data. We propose an intermediate soluti...