1382 search results - page 24 / 277 » Formal Analysis of Online Algorithms |
129
click to vote
APN
2005
Springer
15 years 11 months ago
2005
Springer
In the framework of the study and analysis of new flight procedures, we propose a new Petri net-based formalism to represent both continuous and discrete evolutions and uncertaint...
133
click to vote
SODA
2008
ACM
15 years 7 months ago
2008
ACM
In this paper, we study an online make-to-order variant of the classical joint replenishment problem (JRP) that has been studied extensively over the years and plays a fundamental...
149
click to vote
ICDCS
1995
IEEE
15 years 9 months ago
1995
IEEE
Protocols that provide reliable communicationon top of a network that can lose packets rely on periodically retransmitting packets. The choice of retransmission timeout critically...
156
click to vote
TCS
2008
15 years 5 months ago
2008
We study the usefulness of lookahead in online server routing problems: if an online algorithm is not only informed about the requests released so far, but also has a limited abil...
161
click to vote
CRYPTO
2006
Springer
15 years 9 months ago
2006
Springer
In this paper we formalize a general model of cryptanalytic time/memory tradeoffs for the inversion of a random function f : {0, 1, . . . , N - 1} {0, 1, . . . , N - 1}. The model...