Sciweavers

724 search results - page 120 / 145
» Practical Performance of Efficient Minimum Cut Algorithms
Sort
View
POPL
2007
ACM
16 years 3 months ago
Locality approximation using time
Reuse distance (i.e. LRU stack distance) precisely characterizes program locality and has been a basic tool for memory system research since the 1970s. However, the high cost of m...
Xipeng Shen, Jonathan Shaw, Brian Meeker, Chen Din...
COMCOM
2008
143views more  COMCOM 2008»
15 years 3 months ago
Cross-layer rate control, medium access control and routing design in cooperative VANET
In this paper, we address the rate control, the Medium Access Control (MAC) and the routing problem for cooperative Vehicular Ad-Hoc Network (VANET) in the framework of cross-laye...
Liang Zhou, Baoyu Zheng, Benoit Geller, Anne Wei, ...
ICWS
2010
IEEE
15 years 4 months ago
Highly Scalable Web Service Composition Using Binary Tree-Based Parallelization
Data intensive applications, e.g. in life sciences, pose new efficiency challenges to the service composition problem. Since today computing power is mainly increased by multiplica...
Patrick Hennig, Wolf-Tilo Balke
QEST
2010
IEEE
15 years 29 days ago
Symblicit Calculation of Long-Run Averages for Concurrent Probabilistic Systems
Abstract--Model checkers for concurrent probabilistic systems have become very popular within the last decade. The study of long-run average behavior has however received only scan...
Ralf Wimmer, Bettina Braitling, Bernd Becker, Erns...
CORR
2010
Springer
130views Education» more  CORR 2010»
15 years 3 months ago
On Polynomial Multiplication in Chebyshev Basis
In a recent paper Lima, Panario and Wang have provided a new method to multiply polynomials in Chebyshev basis which aims at reducing the total number of multiplication when polyn...
Pascal Giorgi