Sciweavers

4908 search results - page 55 / 982
» On the Complexity of Optimal K-Anonymity
Sort
View
TSMC
2011
258views more  TSMC 2011»
15 years 1 months ago
Cross-Entropy Optimization of Control Policies With Adaptive Basis Functions
—This paper introduces an algorithm for direct search of control policies in continuous-state discrete-action Markov decision processes. The algorithm looks for the best closed-l...
Lucian Busoniu, Damien Ernst, Bart De Schutter, Ro...
TWC
2011
291views more  TWC 2011»
15 years 1 months ago
On Optimal Cooperator Selection Policies for Multi-Hop Ad Hoc Networks
Abstract—In this paper we consider wireless cooperative multihop networks, where nodes that have decoded the message at the previous hop cooperate in the transmission toward the ...
Michele Rossi, Cristiano Tapparello, Stefano Tomas...
JMLR
2012
13 years 8 months ago
Multi Kernel Learning with Online-Batch Optimization
In recent years there has been a lot of interest in designing principled classification algorithms over multiple cues, based on the intuitive notion that using more features shou...
Francesco Orabona, Jie Luo, Barbara Caputo
MOBILIGHT
2010
15 years 4 months ago
CogProt: A Framework for Cognitive Configuration and Optimization of Communication Protocols
Advancements in network technologies dramatically increased management complexity. Cognitive networking was introduced to deal with this problem, by providing algorithms for autono...
Dzmitry Kliazovich, Neumar Malheiros, Nelson L. S....
TEC
2010
203views more  TEC 2010»
15 years 26 days ago
Niching Without Niching Parameters: Particle Swarm Optimization Using a Ring Topology
Niching is an important technique for multimodal optimization. Most existing niching methods require specification of certain niching parameters in order to perform well. These nic...
Xiaodong Li