Sciweavers

1429 search results - page 134 / 286
» The Complexity of the Approximation of the Bandwidth Problem
Sort
View
MICRO
2003
IEEE
109views Hardware» more  MICRO 2003»
14 years 2 months ago
TLC: Transmission Line Caches
It is widely accepted that the disproportionate scaling of transistor and conventional on-chip interconnect performance presents a major barrier to future high performance systems...
Bradford M. Beckmann, David A. Wood
CN
1998
64views more  CN 1998»
13 years 8 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
JCSS
2008
138views more  JCSS 2008»
13 years 9 months ago
Reducing mechanism design to algorithm design via machine learning
We use techniques from sample-complexity in machine learning to reduce problems of incentive-compatible mechanism design to standard algorithmic questions, for a broad class of re...
Maria-Florina Balcan, Avrim Blum, Jason D. Hartlin...
NIPS
1996
13 years 10 months ago
Reinforcement Learning for Dynamic Channel Allocation in Cellular Telephone Systems
In cellular telephone systems, an important problem is to dynamically allocate the communication resource channels so as to maximize service in a stochastic caller environment. Th...
Satinder P. Singh, Dimitri P. Bertsekas
ICDE
2010
IEEE
193views Database» more  ICDE 2010»
14 years 4 months ago
Schema covering: a step towards enabling reuse in information integration
Abstract—We introduce schema covering, the problem of identifying easily understandable common objects for describing large and complex schemas. Defining transformations between...
Barna Saha, Ioana Stanoi, Kenneth L. Clarkson