3406 search results - page 142 / 682 » Computational models of classical conditioning |
134
click to vote
AAAI
2012
13 years 7 months ago
2012
We consider the classic cake cutting problem where one allocates a divisible cake to n participating agents. Among all valid divisions, fairness and efficiency (a.k.a. social wel...
143
Voted
GAMESEC
2010
15 years 2 months ago
2010
Abstract. Even the most well-motivated models of information security have application limitations due to the inherent uncertainties involving risk. This paper exemplifies a formal...
110
Voted
CIG
2005
IEEE
15 years 10 months ago
2005
IEEE
Abstract- This paper proposes a similarity-based approach for opponent modelling in multi-agent games. The classification accuracy is increased by adding derived attributes from i...
111
click to vote
FUIN
2008
15 years 4 months ago
2008
Reachability analysis is one of the most successful methods used in design and validation of protocols for classical communication, whereas the predicate/transition-net formalism i...
116
Voted
ECIR
2009
Springer
16 years 1 months ago
2009
Springer
The traditional retrieval models based on term matching are not effective in collections of degraded documents (output of OCR or ASR systems for instance). This paper presents a n...