Sciweavers

181 search results - page 11 / 37
» Polynomial Learning of Distribution Families
Sort
View
ICML
1995
IEEE
14 years 10 months ago
Ant-Q: A Reinforcement Learning Approach to the Traveling Salesman Problem
In this paper we introduce Ant-Q, a family of algorithms which present many similarities with Q-learning (Watkins, 1989), and which we apply to the solution of symmetric and asymm...
Luca Maria Gambardella, Marco Dorigo
TON
2010
126views more  TON 2010»
13 years 4 months ago
MAC Scheduling With Low Overheads by Learning Neighborhood Contention Patterns
Aggregate traffic loads and topology in multi-hop wireless networks may vary slowly, permitting MAC protocols to `learn' how to spatially coordinate and adapt contention patte...
Yung Yi, Gustavo de Veciana, Sanjay Shakkottai
FLAIRS
2001
13 years 11 months ago
User-Agent Interactions in Mixed-Initiative Learning
Mixed-initiative learning integrates complementary human and automated reasoning, taking advantage of their respective reasoning styles and computational strengths in order to sol...
Dorin Marcu, Mihai Boicu, Gheorghe Tecuci
ICASSP
2011
IEEE
13 years 1 months ago
Compact support kernels based time-frequency distributions: Performance evaluation
This paper presents two new time-frequency distributions based on kernels with compact support (KCS) namely the separable CB (SCB) and the polynomial CB (PCB) TFDs. The implementa...
Mansour Abed, Adel Belouchrani, Mohamed Cheriet, B...
ATAL
2006
Springer
14 years 1 months ago
Junta distributions and the average-case complexity of manipulating elections
Encouraging voters to truthfully reveal their preferences in an election has long been an important issue. Previous studies have shown that some voting protocols are hard to manip...
Ariel D. Procaccia, Jeffrey S. Rosenschein