Sciweavers

198 search results - page 7 / 40
» Anytime Bounded Rationality
Sort
View
SIAMCO
2010
147views more  SIAMCO 2010»
14 years 8 months ago
Anytime Reliable Transmission of Real-Valued Information through Digital Noisy Channels
Abstract. The problem of reliably transmitting a real-valued random vector through a digital noisy channel is relevant for the design of distributed estimation and control techniqu...
Giacomo Como, Fabio Fagnani, Sandro Zampieri
CORR
2011
Springer
178views Education» more  CORR 2011»
14 years 4 months ago
Anytime Reliable Codes for Stabilizing Plants over Erasure Channels
—The problem of stabilizing an unstable plant over a noisy communication link is an increasingly important one that arises in problems of distributed control and networked contro...
Ravi Teja Sukhavasi, Babak Hassibi
ESA
1999
Springer
110views Algorithms» more  ESA 1999»
15 years 1 months ago
Geometric Searching over the Rationals
We revisit classical geometric search problems under the assumption of rational coordinates. Our main result is a tight bound for point separation, ie, to determine whether n given...
Bernard Chazelle
LFCS
2009
Springer
15 years 4 months ago
Logic and Bounded-Width Rational Languages of Posets over Countable Scattered Linear Orderings
In this paper we consider languages of labelled N-free posets over countable and scattered linear orderings. We prove that a language of such posets is series-rational if and only ...
Nicolas Bedon