Sciweavers

44651 search results - page 108 / 8931
» Generalized
Sort
View
IJCAI
2001
13 years 11 months ago
R-MAX - A General Polynomial Time Algorithm for Near-Optimal Reinforcement Learning
R-max is a very simple model-based reinforcement learning algorithm which can attain near-optimal average reward in polynomial time. In R-max, the agent always maintains a complet...
Ronen I. Brafman, Moshe Tennenholtz
IJCAI
2003
13 years 11 months ago
On a generalization of triangulated graphs for domains decomposition of CSPs
In [Jegou, 1993], a decomposition method has been introduced for improving search efficiency in the area of Constraint Satisfaction Problems. This method is based on properties of...
Assef Chmeiss, Philippe Jégou, Lamia Keddar
AAAI
2000
13 years 11 months ago
Improved Algorithms for Optimal Winner Determination in Combinatorial Auctions and Generalizations
Combinatorial auctions can be used to reach efficient resource and task allocations in multiagent systems where the items are complementary. Determining the winners is NP-complete...
Tuomas Sandholm, Subhash Suri
AVI
2000
13 years 11 months ago
Button Selection for General GUIs Using Eye and Hand Together
This paper proposes an efficient technique for eye gaze interface suitable for the general GUI environments such as Microsoft Windows. Our technique uses an eye and a hand togethe...
Masatake Yamamoto, Akito Monden, Ken-ichi Matsumot...
SODA
1997
ACM
119views Algorithms» more  SODA 1997»
13 years 11 months ago
Map Labeling and Its Generalizations
Map labeling is of fundamental importance in cartography and geographical information systems and is one of the areas targeted for research by the ACM Computational Geometry Impac...
Srinivas Doddi, Madhav V. Marathe, Andy Mirzaian, ...