Sciweavers

14548 search results - page 2432 / 2910
» The Optimal Path-Matching Problem
Sort
View
196
Voted
CORR
2010
Springer
101views Education» more  CORR 2010»
15 years 7 months ago
Probing Capacity
We consider the problem of optimal probing of states of a channel by transmitter and receiver for maximizing rate of reliable communication. The channel is discrete memoryless (DM...
Himanshu Asnani, Haim H. Permuter, Tsachy Weissman
CORR
2008
Springer
189views Education» more  CORR 2008»
15 years 7 months ago
Algorithms for Dynamic Spectrum Access with Learning for Cognitive Radio
We study the problem of dynamic spectrum sensing and access in cognitive radio systems as a partially observed Markov decision process (POMDP). A group of cognitive users cooperati...
Jayakrishnan Unnikrishnan, Venugopal V. Veeravalli
CORR
2010
Springer
187views Education» more  CORR 2010»
15 years 7 months ago
Learning in A Changing World: Non-Bayesian Restless Multi-Armed Bandit
We consider the restless multi-armed bandit (RMAB) problem with unknown dynamics. In this problem, at each time, a player chooses K out of N (N > K) arms to play. The state of ...
Haoyang Liu, Keqin Liu, Qing Zhao
CPHYSICS
2010
135views more  CPHYSICS 2010»
15 years 7 months ago
An events based algorithm for distributing concurrent tasks on multi-core architectures
In this paper, a programming model is presented which enables scalable parallel performance on multi-core shared memory architectures. The model has been developed for application...
David W. Holmes, John R. Williams, Peter Tilke
CORR
2008
Springer
106views Education» more  CORR 2008»
15 years 7 months ago
Resource Allocation and Relay Selection for Collaborative Communications
Abstract--We investigate the relay selection problem in a network where users are able to collaborate with each other; decode and forward the messages of each other along with thei...
Saeed Akhavan-Astaneh, Saeed Gazor
« Prev « First page 2432 / 2910 Last » Next »