Sciweavers

395 search results - page 27 / 79
» Positive Versions of Polynomial Time
Sort
View
CORR
2007
Springer
99views Education» more  CORR 2007»
14 years 9 months ago
Services within a busy period of an M/M/1 queue and Dyck paths
We analyze the service times of customers in a stable M/M/1 queue in equilibrium depending on their position in a busy period. We give the law of the service of a customer at the b...
Moez Draief, Jean Mairesse
ENTCS
2002
61views more  ENTCS 2002»
14 years 9 months ago
Effectively Absolute Continuity and Effective Jordan Decomposability
Classically, any absolute continuous real function is of bounded variation and hence can always be expressed as a difference of two increasing continuous functions (socalled Jorda...
Xizhong Zheng, Robert Rettinger, Burchard von Brau...
VLDB
2002
ACM
141views Database» more  VLDB 2002»
14 years 9 months ago
A Multi-version Cache Replacement and Prefetching Policy for Hybrid Data Delivery Environments
This paper introduces MICP, a novel multiversion integrated cache replacement and prefetching algorithm designed for efficient cache and transaction management in hybrid data deli...
André Seifert, Marc H. Scholl
AOR
2006
95views more  AOR 2006»
14 years 10 months ago
A New Practically Efficient Interior Point Method for LP
In this paper we briefly review the importance of LP (linear programming), and Dantzig's main contributions to OR (Operations Research), mathematics, and computer science. In...
Katta G. Murty
STOC
2010
ACM
186views Algorithms» more  STOC 2010»
15 years 2 months ago
Faster approximation schemes for fractional multicommodity flow problems via dynamic graph algorithms
We combine the work of Garg and K¨onemann, and Fleischer with ideas from dynamic graph algorithms to obtain faster (1 − ε)-approximation schemes for various versions of the mu...
Aleksander Madry