Sciweavers

1510 search results - page 128 / 302
» Upper Probabilities and Additivity
Sort
View
COCO
2009
Springer
106views Algorithms» more  COCO 2009»
15 years 4 months ago
Improved Approximation of Linear Threshold Functions
We prove two main results on how arbitrary linear threshold functions f(x) = sign(w · x − θ) over the n-dimensional Boolean hypercube can be approximated by simple threshold f...
Ilias Diakonikolas, Rocco A. Servedio
MOBICOM
2004
ACM
15 years 3 months ago
On k-coverage in a mostly sleeping sensor network
Sensor networks are often desired to last many times longer than the active lifetime of individual sensors. This is usually achieved by putting sensors to sleep for most of their ...
Santosh Kumar, Ten-Hwang Lai, József Balogh
RTSS
1992
IEEE
15 years 2 months ago
Allocation of periodic task modules with precedence and deadline constraints in distributed real-time systems
This paper addresses the problem of allocating (assigning and scheduling) periodic task modules to processing nodes in distributed real-time systems subject to task precedence and ...
Chao-Ju Hou, Kang G. Shin
AIPS
2010
15 years 10 days ago
When Policies Can Be Trusted: Analyzing a Criteria to Identify Optimal Policies in MDPs with Unknown Model Parameters
Computing a good policy in stochastic uncertain environments with unknown dynamics and reward model parameters is a challenging task. In a number of domains, ranging from space ro...
Emma Brunskill
WICON
2008
14 years 11 months ago
The effect of cooperation at the network protocol level
Abstract--There has been a great deal of attention on cooperative communication which exploits the spatial diversity among antennas belonging to multiple terminals. Most of the exi...
Beiyu Rong, Anthony Ephremides