Sciweavers

2300 search results - page 195 / 460
» Maximally Concurrent Programs
Sort
View
TIT
2011
116views more  TIT 2011»
15 years 1 months ago
Convex Programming Upper Bounds on the Capacity of 2-D Constraints
—The capacity of 1-D constraints is given by the entropy of a corresponding stationary maxentropic Markov chain. Namely, the entropy is maximized over a set of probability distri...
Ido Tal, Ron M. Roth
ICML
2005
IEEE
16 years 7 months ago
Bounded real-time dynamic programming: RTDP with monotone upper bounds and performance guarantees
MDPs are an attractive formalization for planning, but realistic problems often have intractably large state spaces. When we only need a partial policy to get from a fixed start s...
H. Brendan McMahan, Maxim Likhachev, Geoffrey J. G...
ICC
2007
IEEE
139views Communications» more  ICC 2007»
16 years 23 days ago
Optimal Power Allocation for Amplify-And-Forward Relay Networks via Conic Programming
— Relay power allocation has been shown to provide substantial performance gain in wireless relay channels when perfect global channel state information (CSI) is available. In th...
Tony Q. S. Quek, Moe Z. Win, Hyundong Shin, Marco ...
IPM
1998
176views more  IPM 1998»
15 years 6 months ago
Interfaces and Tools for the Library of Congress National Digital Library Program
This paper describes a collaborative effort to explore user needs in a digital library, develop interface prototypes for a digital library, and suggest and prototype tools for dig...
Gary Marchionini, Catherine Plaisant, Anita Komlod...
SIGCOMM
2010
ACM
15 years 6 months ago
Cone of silence: adaptively nulling interferers in wireless networks
Dense 802.11 wireless networks present a pressing capacity challenge: users in proximity contend for limited unlicensed spectrum. Directional antennas promise increased capacity b...
Georgios Nikolaidis, Astrit Zhushi, Kyle Jamieson,...