407 search results - page 30 / 82 » The Optimal Online Algorithms for Minimizing Maximum Latenes... |
STACS
2010
Springer
15 years 6 months ago
2010
Springer
We study the online clustering problem where data items arrive in an online fashion. The algorithm maintains a clustering of data items into similarity classes. Upon arrival of v, ...
102
click to vote
ICCAD
1994
IEEE
15 years 4 months ago
1994
IEEE
A simple extension of the critical path method is presented which allows more accurate optimization of circuits with level-sensitive latches. The extended formulation provides a s...
108
click to vote
MMS
2000
14 years 11 months ago
2000
Excessive buffer requirement to handle continuous-media playbacks is an impediment to costeffective provisioning for on-line video retrieval. Given the skewed distribution of video...
114
click to vote
AROBOTS
2002
14 years 11 months ago
2002
To navigate in unknown environments, mobile robots require the ability to build their own maps. A major problem for robot map building is that odometry-based dead reckoning cannot ...
ISAAC
2003
Springer
15 years 5 months ago
2003
Springer
We consider the problem of characterizing user equilibria and optimal solutions for selfish routing in a given network. We extend the known models by considering malicious behavio...