227 search results - page 20 / 46 » A Competitive Algorithm for the General 2-Server Problem |
ESA
2004
Springer
14 years 1 months ago
2004
Springer
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...
ICALP
2003
Springer
14 years 1 months ago
2003
Springer
We provide a new simpler approach to the on-line load balancing problem in the case of restricted assignment of temporary weighted tasks. The approach is very general and allows to...
AAIM
2009
Springer
14 years 3 months ago
2009
Springer
In the frequency assignment problem we are given a graph representing a wireless network and a sequence of requests, where each request is associated with a vertex. Each request h...
ATAL
2005
Springer
14 years 2 months ago
2005
Springer
A team-based competitive environment is a complex multiagent environment, in which agents are required to coordinate with each other not only to enhance their collective behavior,...
FOCS
2007
IEEE
14 years 2 months ago
2007
IEEE
In the weighted paging problem there is a weight (cost) for fetching each page into the cache. We design a randomized O(log k)-competitive online algorithm for the weighted paging...