21 search results - page 4 / 5 » Solving CSPs with Naming Games |
FLAIRS
2009
13 years 5 months ago
2009
Partially observable stochastic games (POSGs) provide a rich mathematical framework for planning under uncertainty by a group of agents. However, this modeling advantage comes wit...
SSS
2009
Springer
14 years 1 months ago
2009
Springer
Graph searching games have been extensively studied in the past years. The graph searching problem involves a team of searchers who are attempting to capture a fugitive moving alon...
ACG
2006
Springer
14 years 1 months ago
2006
Springer
First, this paper introduces a new family of k-in-a-row games, Connect(m, n, k, p, q). In Connect(m, n, k, p, q), two players alternately place p stones on an m × n board in each ...
PAKDD
2005
ACM
14 years 25 days ago
2005
ACM
Abstract. This paper establishes the foundation for the performance measurements of privacy preserving data mining techniques. The performance is measured in terms of the accuracy ...
IAT
2008
IEEE
14 years 1 months ago
2008
IEEE
The automation of agents that bargain within markets is a challenging open problem. In these settings a seller agent can take advantage from the competition among several buyer ag...