Sciweavers

14 search results - page 3 / 3
» Extractors and Lower Bounds for Locally Samplable Sources
Sort
View
AI
2010
Springer
13 years 6 months ago
Soft arc consistency revisited
The Valued Constraint Satisfaction Problem (VCSP) is a generic optimization problem defined by a network of local cost functions defined over discrete variables. It has applicatio...
Martin C. Cooper, Simon de Givry, M. Sanchez, Thom...
DATE
2009
IEEE
118views Hardware» more  DATE 2009»
14 years 1 months ago
Gate sizing for large cell-based designs
—Today, many chips are designed with predefined discrete cell libraries. In this paper we present a new fast gate sizing algorithm that works natively with discrete cell choices...
Stephan Held
LCN
2008
IEEE
14 years 24 days ago
Speedo: Realistic achievable bandwidth in 802.11 through passive monitoring
—End to end available bandwidth is often constrained by IEEE 802.11 hops in the access network. Available bandwidth measurement is particularly challenging in the wireless enviro...
Malik Ahmad Yar Khan, Darryl Veitch
MOBICOM
2006
ACM
14 years 11 days ago
On optimal communication cost for gathering correlated data through wireless sensor networks
In many energy-constrained wireless sensor networks, nodes cooperatively forward correlated sensed data to data sinks. In order to reduce the communication cost (e.g. overall ener...
Junning Liu, Micah Adler, Donald F. Towsley, Chun ...