2252 search results - page 144 / 451 » Lower Bounds for Dynamic Algorithms |
125
click to vote
ALDT
2009
Springer
15 years 10 months ago
2009
Springer
Traditional performance analysis of approximation algorithms considers overall performance, while economic fairness analysis focuses on the individual performance each user receiv...
120
click to vote
SIGECOM
2004
ACM
15 years 8 months ago
2004
ACM
For the problem of online real-time scheduling of jobs on a single processor, previous work presents matching upper and lower bounds on the competitive ratio that can be achieved ...
124
Voted
PAKDD
2009
ACM
15 years 8 months ago
2009
ACM
Given a set of rating data for a set of items, determining the values of items is a matter of importance and various probability models have been proposed. The Plackett-Luce model ...
130
Voted
WEA
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. We consider the problem of fast IP address lookup in the forwarding engines of Internet routers. We analyze over 2400 public snapshots of routing tables collected over ï¬...
178
click to vote
IRREGULAR
1998
Springer
15 years 7 months ago
1998
Springer
To achieve scalable parallel performance in Molecular Dynamics Simulation, we have modeled and implemented several dynamic spatial domain decomposition algorithms. The modeling is ...