Sciweavers

265 search results - page 27 / 53
» Not Everything We Know We Learned
Sort
View
ATAL
2006
Springer
15 years 1 months ago
Learning to commit in repeated games
Learning to converge to an efficient, i.e., Pareto-optimal Nash equilibrium of the repeated game is an open problem in multiagent learning. Our goal is to facilitate the learning ...
Stéphane Airiau, Sandip Sen
PERCOM
2009
ACM
15 years 4 months ago
A Distributed k-Anonymity Protocol for Location Privacy
To benefit from a location-based service, a person must reveal her location to the service. However, knowing the person’s location might allow the service to re-identify the pe...
Ge Zhong, Urs Hengartner
AI
2007
Springer
14 years 9 months ago
Learning action models from plan examples using weighted MAX-SAT
AI planning requires the definition of action models using a formal action and plan description language, such as the standard Planning Domain Definition Language (PDDL), as inp...
Qiang Yang, Kangheng Wu, Yunfei Jiang
JAIR
2008
148views more  JAIR 2008»
14 years 9 months ago
Learning Partially Observable Deterministic Action Models
We present exact algorithms for identifying deterministic-actions' effects and preconditions in dynamic partially observable domains. They apply when one does not know the ac...
Eyal Amir, Allen Chang
ICDM
2008
IEEE
120views Data Mining» more  ICDM 2008»
15 years 4 months ago
Predicting Future Decision Trees from Evolving Data
Recognizing and analyzing change is an important human virtue because it enables us to anticipate future scenarios and thus allows us to act pro-actively. One approach to understa...
Mirko Böttcher, Martin Spott, Rudolf Kruse