297 search results - page 42 / 60 » Every Sequence Is Decompressible from a Random One |
EOR
2006
14 years 11 months ago
2006
In this paper, we develop an acyclic network of queues for the design of a dynamic flow shop, where each service station represents a machine. The orders arrive at the input stati...
104
click to vote
CORR
2010
Springer
14 years 11 months ago
2010
Springer
Abstract. We present the discrete beeping communication model, which assumes nodes have minimal knowledge about their environment and severely limited communication capabilities. S...
96
Voted
TIT
2002
14 years 10 months ago
2002
The problem of optimal sequential decision for individual sequences, relative to a class of competing o -line reference strategies, is studied for general loss functions with memo...
STOC
2001
ACM
15 years 11 months ago
2001
ACM
We study error-correcting codes for highly noisy channels. For example, every received signal in the channel may originate from some half of the symbols in the alphabet. Our main c...
89
Voted
CORR
2010
Springer
14 years 11 months ago
2010
Springer
: We study a slotted version of the Aloha Medium Access (MAC) protocol in a Mobile Ad-hoc Network (MANET). Our model features transmitters randomly located in the Euclidean plane, ...