Sciweavers

478 search results - page 87 / 96
» Improving probability bounds by optimization over subsets
Sort
View
CORR
2008
Springer
131views Education» more  CORR 2008»
13 years 7 months ago
Jamming in Fixed-Rate Wireless Systems with Power Constraints - Part I: Fast Fading Channels
This is the first part of a two-part paper that studies the problem of jamming in a fixed-rate transmission system with fading, under the general assumption that the jammer has no...
George T. Amariucai, Shuangqing Wei
TON
2002
99views more  TON 2002»
13 years 7 months ago
Computing shortest paths for any number of hops
In this paper we introduce and investigate a new" path optimization problem which we denote as the All Hops Optimal Path AHOP problem. The problem involves identifying, for a...
Roch Guérin, Ariel Orda
WINET
2002
61views more  WINET 2002»
13 years 7 months ago
Multiple Working Points in Multichannel ALOHA with Deadlines
Abstract. This paper addresses the problem of maximizing the capacity of multichannel slotted ALOHA networks subject to a userspecified deadline and a permissible probability of ex...
Dror Baron, Yitzhak Birk
TCOM
2010
91views more  TCOM 2010»
13 years 5 months ago
Slot-wise maximum likelihood estimation of the tag population size in FSA protocols
Abstract—Framed Slotted Aloha (FSA) is a popular anticollision technique in state-of-the-art RF-ID systems, as in ISO/IEC CD 18000-6 for 900MHz or the EPCglobal HF Gen 2 draft fo...
Bastian Knerr, Martin Holzer 0002, Christoph Anger...
ASIAN
2004
Springer
180views Algorithms» more  ASIAN 2004»
14 years 27 days ago
Counting by Coin Tossings
Abstract. This text is an informal review of several randomized algorithms that have appeared over the past two decades and have proved instrumental in extracting efficiently quant...
Philippe Flajolet