Sciweavers

721 search results - page 109 / 145
» On Generators of Random Quasigroup Problems
Sort
View
ESA
2004
Springer
127views Algorithms» more  ESA 2004»
14 years 1 months ago
Load Balancing of Indivisible Unit Size Tokens in Dynamic and Heterogeneous Networks
The task of balancing dynamically generated work load occurs in a wide range of parallel and distributed applications. Diffusion based schemes, which belong to the class of nearest...
Robert Elsässer, Burkhard Monien, Stefan Scha...
KI
2001
Springer
14 years 19 days ago
Constraint-Based Optimization of Priority Schemes for Decoupled Path Planning Techniques
Abstract Coordinating the motion of multiple mobile robots is one of the fundamental problems in robotics. The predominant algorithms for coordinating teams of robots are decoupled...
Maren Bennewitz, Wolfram Burgard, Sebastian Thrun
IPPS
2000
IEEE
14 years 17 days ago
Optimal on Demand Packet Scheduling in Single-Hop Multichannel Communication Systems
In this paper, we study the problem of on demand minimum length packet scheduling in single-hop multichannel systems. Examples of these systems are those centered around switching...
Maurizio A. Bonuccelli, Susanna Pelagatti
STOC
1997
ACM
126views Algorithms» more  STOC 1997»
14 years 11 days ago
Page Replacement with Multi-Size Pages and Applications to Web Caching
We consider the paging problem where the pages have varying size. This problem has applications to page replacement policies for caches containing World Wide Web documents. We con...
Sandy Irani
SPAA
1994
ACM
14 years 7 days ago
Bounds on the Greedy Routing Algorithm for Array Networks
We analyze the performance of greedy routing for array networks by providing bounds on the average delay and the average number of packets in the system for the dynamic routing pr...
Michael Mitzenmacher