Sciweavers

1754 search results - page 165 / 351
» The Computational Complexity of Delay Management
Sort
View
213
Voted
ICPADS
2007
IEEE
16 years 1 months ago
Energy-efficient anonymous multicast in mobile ad-hoc networks
Protecting personal privacy and energy efficiency are two primary concerns for mobile ad hoc networks. However, no energy-efficient multicast algorithm designed for preserving ano...
Jung-Chun Kao, Radu Marculescu
CCR
2004
110views more  CCR 2004»
15 years 7 months ago
Distributed scheduling policies in networks of input-queued packet switches
Scheduling algorithms for input-queued packet switches have been widely researched. It has been shown that various classes of scheduling algorithms provide guarantees on stability ...
Claus Bauer
CGF
2004
113views more  CGF 2004»
15 years 7 months ago
Coherent Hierarchical Culling: Hardware Occlusion Queries Made Useful
We present a simple but powerful algorithm for optimizing the usage of hardware occlusion queries in arbitrary complex scenes. Our method minimizes the number of issued queries an...
Jirí Bittner, Michael Wimmer, Harald Piring...
INFOCOM
2000
IEEE
15 years 11 months ago
Networks with Advance Reservations: The Routing Perspective
— This paper provides an initial look at how support for advance reservations affects the complexity of the path selection process in networks. Advance reservations are likely to...
Roch Guérin, Ariel Orda
AICCSA
2005
IEEE
113views Hardware» more  AICCSA 2005»
15 years 9 months ago
Towards autonomic Web services
Autonomic Computing was introduced to reduce the complexity of managing computing systems; however, the heterogeneous nature existing in most computing systems introduces some dif...
Amir Zeid, Sherif A. Gurguis