244 search results - page 39 / 49 » On-Line Probability, Complexity and Randomness |
CDC
2009
IEEE
14 years 1 months ago
2009
IEEE
Abstract— We propose formal models for analyzing robustness of multi-hop control networks, where data from sensors to controllers and from controllers to actuators is sent throug...
IDA
2010
Springer
13 years 10 months ago
2010
Springer
Abstract. We propose a generic framework and methods for simplification of large networks. The methods can be used to improve the understandability of a given network, to complemen...
GLOBECOM
2007
IEEE
13 years 9 months ago
2007
IEEE
—Via collaborative beamforming, nodes in a wireless network are able to transmit a common message over long distances in an energy efficient fashion. However, the process of mak...
ECCC
2010
13 years 9 months ago
2010
An (r, , )-locally decodable code encodes a k-bit message x to an N-bit codeword C(x), such that for every i [k], the i-th message bit can be recovered with probability 1 - , by ...
TCAD
2008
13 years 8 months ago
2008
Abstract--In this paper, we propose track routing and optimization for yield (TROY), the first track router for the optimization of yield loss due to random defects. As the probabi...