Sciweavers

1510 search results - page 45 / 302
» Upper Probabilities and Additivity
Sort
View
TSP
2010
13 years 5 months ago
An adaptive cooperation diversity scheme with best-relay selection in cognitive radio networks
In this paper, an adaptive cooperation diversity scheme with best-relay selection is proposed for multiple-relay cognitive radio networks to improve the performance of secondary tr...
YuLong Zou, Jia Zhu, Baoyu Zheng, Yu-Dong Yao
ISIPTA
2003
IEEE
14 years 4 months ago
Expected Utility with Multiple Priors
Let be a preference relation on a convex set F. Necessary and sufficient conditions are given that guarantee the existence of a set {ul} of affine utility functions on F such th...
Erio Castagnoli, Fabio Maccheroni, Massimo Marinac...
RTCSA
2007
IEEE
14 years 5 months ago
Real-Time Scheduling with Task Splitting on Multiprocessors
This paper presents a real-time scheduling algorithm with high schedulability and few preemptions for multiprocessor systems. The algorithm is based on an unorthodox method called...
Shinpei Kato, Nobuyuki Yamasaki
SODA
2004
ACM
104views Algorithms» more  SODA 2004»
14 years 10 days ago
Tight bounds for the partial-sums problem
We close the gaps between known lower and upper bounds for the online partial-sums problem in the RAM and group models of computation. If elements are chosen from an abstract grou...
Mihai Patrascu, Erik D. Demaine
CORR
2008
Springer
138views Education» more  CORR 2008»
13 years 11 months ago
On the Capacity of Free-Space Optical Intensity Channels
New upper and lower bounds are presented on the capacity of the free-space optical intensity channel. This channel is characterized by inputs that are nonnegative (representing the...
Amos Lapidoth, Stefan M. Moser, Michele A. Wigger