Sciweavers

557 search results - page 75 / 112
» Optimization Algorithms for Large Self-Structuring Networks
Sort
View
SIGMETRICS
2008
ACM
150views Hardware» more  SIGMETRICS 2008»
13 years 9 months ago
Performance of random medium access control, an asymptotic approach
Random Medium-Access-Control (MAC) algorithms have played an increasingly important role in the development of wired and wireless Local Area Networks (LANs) and yet the performanc...
Charles Bordenave, David McDonald, Alexandre Prout...
SPAA
1997
ACM
14 years 1 months ago
Accessing Nearby Copies of Replicated Objects in a Distributed Environment
Consider a set of shared objects in a distributed network, where several copies of each object may exist at any given time. To ensure both fast access to the objects as well as e ...
C. Greg Plaxton, Rajmohan Rajaraman, Andréa...
DSOM
2009
Springer
14 years 3 months ago
Self-optimizing Hybrid Routing in Publish/Subscribe Systems
Rendering networks and distributed systems self-managing and self-optimizing has become a major research focus. This task is especially important for systems, such as publish/subsc...
Arnd Schröter, Daniel Graff, Gero Mühl, ...
AAAI
2004
13 years 10 months ago
Leap Before You Look: An Effective Strategy in an Oversubscribed Scheduling Problem
Oversubscribed scheduling problems require removing or partially satisfying tasks when enough resources are not available. For a particular oversubscribed problem, Air Force Satel...
Laura Barbulescu, L. Darrell Whitley, Adele E. How...
ATMOS
2007
177views Optimization» more  ATMOS 2007»
13 years 10 months ago
Approximate dynamic programming for rail operations
Abstract. Approximate dynamic programming offers a new modeling and algorithmic strategy for complex problems such as rail operations. Problems in rail operations are often modeled...
Warren B. Powell, Belgacem Bouzaïene-Ayari