787 search results - page 111 / 158 » Modelling Uncertainty in Agent Programming |
106
click to vote
ML
2006
ACM
15 years 13 days ago
2006
ACM
Bridge bidding is considered to be one of the most difficult problems for game-playing programs. It involves four agents rather than two, including a cooperative agent. In additio...
78
Voted
ATAL
2008
Springer
15 years 2 months ago
2008
Springer
We demonstrate two game theory-based programs for headsup limit and no-limit Texas Hold'em poker. The first player, GS3, is designed for playing limit Texas Hold'em, in ...
82
Voted
IAT
2009
IEEE
15 years 7 months ago
2009
IEEE
Distributed Partially Observable Markov Decision Problems (DisPOMDPs) are emerging as a popular approach for modeling sequential decision making in teams operating under uncertain...
114
Voted
ATAL
2005
Springer
15 years 6 months ago
2005
Springer
We present TECTLK, a logic to specify knowledge and real time in multi-agent systems. We show that the model checking problem is decidable, and we present an algorithm for TECTLK ...
AAAI
2006
15 years 1 months ago
2006
Markov decision processes (MDPs) with discrete and continuous state and action components can be solved efficiently by hybrid approximate linear programming (HALP). The main idea ...