35 search results - page 2 / 7 » A Competitive Analysis of the List Update Problem with Looka... |
ATVA
2011
Springer
12 years 5 months ago
2011
Springer
In [AKL10], we showed how viewing online algorithms as reactive systems enables the application of ideas from formal verification to the competitive analysis of online algorithms....
ACTA
2006
13 years 5 months ago
2006
Abstract We consider the problem of maximizing throughput in a multi-carrier wireless network that employs predictive link adaptation. We explicitly consider the time-penalty incur...
DAGSTUHL
1996
13 years 6 months ago
1996
We survey results on self-organizing data structures for the search problem and concentrate on two very popular structures: the unsorted linear list, and the binary search tree. Fo...
ILC
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. We aim at checking safety and temporal properties over models representing the behavior of programs manipulating dynamic singly-linked lists. The properties we consider n...
DATESO
2007
13 years 6 months ago
2007
We address a problem of updating XML documents having their XML schema described by a Document Type Definition (DTD) without breaking their validity. We present a way how to expre...