Sciweavers

502 search results - page 71 / 101
» Monotone Approximation of Decision Problems
Sort
View
FOCS
2006
IEEE
15 years 3 months ago
Generalization of Binary Search: Searching in Trees and Forest-Like Partial Orders
We extend the binary search technique to searching in trees. We consider two models of queries: questions about vertices and questions about edges. We present a general approach t...
Krzysztof Onak, Pawel Parys
77
Voted
CDC
2009
IEEE
118views Control Systems» more  CDC 2009»
15 years 2 months ago
Opportunistic scheduling in cellular systems in the presence of non-cooperative mobiles
Abstract— A central scheduling problem in wireless communications is that of allocating resources to one of many mobile stations that have a common radio channel. Much attention ...
Kavitha Veeraruna, Eitan Altman, Rachid El Azouzi,...
TSMC
2008
146views more  TSMC 2008»
14 years 9 months ago
Decentralized Learning in Markov Games
Learning Automata (LA) were recently shown to be valuable tools for designing Multi-Agent Reinforcement Learning algorithms. One of the principal contributions of LA theory is tha...
Peter Vrancx, Katja Verbeeck, Ann Nowé
IAAI
2001
14 years 11 months ago
CARMA: A Case-Based Range Management Advisor
: CARMA is an advisory system for rangeland grasshopper infestations that demonstrates how AI technology can deliver expert advice to compensate for cutbacks in public services. CA...
Karl Branting, John D. Hastings, Jeffrey A. Lockwo...
JMLR
2006
117views more  JMLR 2006»
14 years 9 months ago
On the Complexity of Learning Lexicographic Strategies
Fast and frugal heuristics are well studied models of bounded rationality. Psychological research has proposed the take-the-best heuristic as a successful strategy in decision mak...
Michael Schmitt, Laura Martignon