Sciweavers

118 search results - page 16 / 24
» Greedy algorithms for on-line set-covering and related probl...
Sort
View
CORR
2008
Springer
189views Education» more  CORR 2008»
14 years 9 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
STACS
2010
Springer
15 years 4 months ago
Online Correlation Clustering
We study the online clustering problem where data items arrive in an online fashion. The algorithm maintains a clustering of data items into similarity classes. Upon arrival of v, ...
Claire Mathieu, Ocan Sankur, Warren Schudy
75
Voted
CORR
2006
Springer
94views Education» more  CORR 2006»
14 years 9 months ago
Fitness Uniform Optimization
Abstract-- In evolutionary algorithms, the fitness of a population increases with time by mutating and recombining individuals and by a biased selection of more fit individuals. Th...
Marcus Hutter, Shane Legg
77
Voted
UAI
2004
14 years 11 months ago
On Finding Minimal w-cutset
The complexity of a reasoning task over a graphical model is tied to the induced width of the underlying graph. It is well-known that the conditioning (assigning values) on a subs...
Bozhena Bidyuk, Rina Dechter
ICASSP
2011
IEEE
14 years 1 months ago
A knapsack problem formulation for relay selection in secure cooperative wireless communication
—Cooperative jamming (CJ) schemes support secure wireless communication in the presence of one or more eavesdroppers. Larger numbers of cooperative relays provide better secrecy ...
Shuangyu Luo, Hana Godrich, Athina P. Petropulu, H...