Sciweavers

205 search results - page 18 / 41
» When Can Limited Randomness Be Used in Repeated Games
Sort
View
CVPR
2007
IEEE
16 years 2 months ago
Robust Real-Time Visual SLAM Using Scale Prediction and Exemplar Based Feature Description
Two major limitations of real-time visual SLAM algorithms are the restricted range of views over which they can operate and their lack of robustness when faced with erratic camera...
Denis Chekhlov, Mark Pupilli, Walterio W. Mayol-Cu...
ATAL
2008
Springer
15 years 2 months ago
MB-AIM-FSI: a model based framework for exploiting gradient ascent multiagent learners in strategic interactions
Future agent applications will increasingly represent human users autonomously or semi-autonomously in strategic interactions with similar entities. Hence, there is a growing need...
Doran Chakraborty, Sandip Sen
COR
2008
111views more  COR 2008»
15 years 23 days ago
An optimization algorithm for the inventory routing problem with continuous moves
The typical inventory routing problem deals with the repeated distribution of a single product from a single facility with an unlimited supply to a set of customers that can all b...
Martin W. P. Savelsbergh, Jin-Hwa Song
78
Voted
INFOCOM
2008
IEEE
15 years 7 months ago
Power-Adjusted Random Access to a Wireless Channel
—The operation of widely-deployed random access to wireless networks is based on limited information on the result of each access attempt. When making a random access attempt, us...
Young-June Choi, Kang G. Shin
114
Voted
TIFS
2008
149views more  TIFS 2008»
15 years 17 days ago
Secure Cooperation in Autonomous Mobile Ad-Hoc Networks Under Noise and Imperfect Monitoring: A Game-Theoretic Approach
In autonomous mobile ad-hoc networks, one major challenge is to stimulate cooperation among selfish nodes, especially when some nodes may be malicious. In this paper, we address co...
Wei Yu, K. J. Ray Liu