Sciweavers

1568 search results - page 63 / 314
» The problem of examination questions in algorithmics
Sort
View
WADS
2009
Springer
298views Algorithms» more  WADS 2009»
15 years 4 months ago
A Comparison of Performance Measures for Online Algorithms
This paper provides a systematic study of several proposed measures for online algorithms in the context of a specific problem, namely, the two server problem on three colinear po...
Joan Boyar, Sandy Irani, Kim S. Larsen
CISS
2008
IEEE
15 years 4 months ago
Distributed algorithm and reversible network
Motivated to design a feasible optical network architecture for the future Internet, we address the question of scheduling (wavelength assignment) in an optical network. The key ch...
Shreevatsa Rajagopalan, Devavrat Shah
ICDCSW
2005
IEEE
15 years 3 months ago
Analysis and Algorithms for Content-Based Event Matching
    Content-based  event  matching  is  an  important  problem  in  large-scale  event-based  publish/subscribe  systems.  However,  open  questions  remain  in ...
Satyen Kale, Elad Hazan, Fengyun Cao, Jaswinder Pa...
75
Voted
FOCS
2007
IEEE
15 years 4 months ago
A Primal-Dual Randomized Algorithm for Weighted Paging
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...
Nikhil Bansal, Niv Buchbinder, Joseph Naor
DAGSTUHL
2007
14 years 11 months ago
Matrix Analytic Methods in Branching processes
We examine the question of solving the extinction probability of a particular class of continuous-time multi-type branching processes, named Markovian binary trees (MBT). The exti...
Sophie Hautphenne, Guy Latouche, Marie-Ange Remich...