Sciweavers

656 search results - page 79 / 132
» Complexity of finite-horizon Markov decision process problem...
Sort
View
ESAW
2006
Springer
15 years 5 months ago
Using Constraints and Process Algebra for Specification of First-Class Agent Interaction Protocols
Abstract. Current approaches to multi-agent interaction involve specifying protocols as sets of possible interactions, and hard-coding decision mechanisms into agent programs in or...
Tim Miller, Peter McBurney
KDD
2006
ACM
272views Data Mining» more  KDD 2006»
16 years 2 months ago
YALE: rapid prototyping for complex data mining tasks
KDD is a complex and demanding task. While a large number of methods has been established for numerous problems, many challenges remain to be solved. New tasks emerge requiring th...
Ingo Mierswa, Michael Wurst, Ralf Klinkenberg, Mar...
ICML
2008
IEEE
16 years 2 months ago
Apprenticeship learning using linear programming
In apprenticeship learning, the goal is to learn a policy in a Markov decision process that is at least as good as a policy demonstrated by an expert. The difficulty arises in tha...
Umar Syed, Michael H. Bowling, Robert E. Schapire
GLOBECOM
2007
IEEE
15 years 8 months ago
Cognitive Medium Access: A Protocol for Enhancing Coexistence in WLAN Bands
— In this paper we propose Cognitive Medium Access (CMA), a protocol aimed at improving coexistence with a set of independently evolving WLAN bands. A time-slotted physical layer...
Stefan Geirhofer, Lang Tong, Brian M. Sadler
ICRA
2006
IEEE
134views Robotics» more  ICRA 2006»
15 years 8 months ago
Hierarchical Map Building and Planning based on Graph Partitioning
— Mobile robot localization and navigation requires a map - the robot’s internal representation of the environment. A common problem is that path planning becomes very ineffic...
Zoran Zivkovic, Bram Bakker, Ben J. A. Kröse