Sciweavers

5183 search results - page 632 / 1037
» The Complexity of Distributions
Sort
View
167
Voted
ESA
2004
Springer
96views Algorithms» more  ESA 2004»
16 years 6 days ago
An Experimental Study of Random Knapsack Problems
The size of the Pareto curve for the bicriteria version of the knapsack problem is polynomial on average. This has been shown for various random input distributions. We experimenta...
René Beier, Berthold Vöcking
ESA
2004
Springer
105views Algorithms» more  ESA 2004»
16 years 6 days ago
Time Dependent Multi Scheduling of Multicast
Many network applications that need to distribute content and data to a large number of clients use a hybrid scheme in which one (or more) multicast channel is used in parallel to...
Rami Cohen, Dror Rawitz, Danny Raz
GECCO
2004
Springer
106views Optimization» more  GECCO 2004»
16 years 6 days ago
Evolving En-Route Caching Strategies for the Internet
Nowadays, large distributed databases are commonplace. Client applications increasingly rely on accessing objects from multiple remote hosts. The Internet itself is a huge network ...
Jürgen Branke, Pablo Funes, Frederik Thiele
HIPC
2004
Springer
16 years 6 days ago
A Shared Memory Dispatching Approach for Partially Clairvoyant Schedulers
It is well known that in a typical real-time system, certain parameters, such as the execution time of a job, are not fixed numbers. In such systems, it is common to characterize ...
K. Subramani, Kiran Yellajyosula
WDAG
2004
Springer
144views Algorithms» more  WDAG 2004»
16 years 5 days ago
Contention-Free MAC Protocols for Wireless Sensor Networks
Abstract. A MAC protocol specifies how nodes in a sensor network access a shared communication channel. Desired properties of such MAC protocol are: it should be distributed and c...
Costas Busch, Malik Magdon-Ismail, Fikret Sivrikay...