Sciweavers

4066 search results - page 405 / 814
» Almost Complete Sets
Sort
View
CN
1998
64views more  CN 1998»
15 years 6 months ago
Decentralized Network Connection Preemption Algorithms
Connection preemption provides available and reliable services to high-priority connections when a network is heavily loaded and connection request arrival patterns are unknown, o...
Mohammad Peyravian, Ajay D. Kshemkalyani
RSA
1998
93views more  RSA 1998»
15 years 6 months ago
Parallel randomized load balancing
It is well known that after placing n balls independently and uniformly at random into n bins, the fullest bin holds (logn=log logn) balls with high probability. Recently, Azar et...
Micah Adler, Soumen Chakrabarti, Michael Mitzenmac...
TVLSI
2002
97views more  TVLSI 2002»
15 years 6 months ago
Techniques for energy-efficient communication pipeline design
The performance of many modern computer and communication systems is dictated by the latency of communication pipelines. At the same time, power/energy consumption is often another...
Gang Qu, Miodrag Potkonjak
RE
2008
Springer
15 years 6 months ago
Design Science, Engineering Science and Requirements Engineering
For several decades there has been a debate in the computing sciences about the relative roles of design and empirical research, and about the contribution of design and research ...
Roel Wieringa, J. M. G. Heerkens
JCST
2010
147views more  JCST 2010»
15 years 5 months ago
Volumetric Vector-Based Representation for Indirect Illumination Caching
Abstract This paper introduces a caching technique based on a volumetric representation that captures low-frequency indirect illumination. This structure is intended for efficient ...
Romain Pacanowski, Xavier Granier, Christophe Schl...