1094 search results - page 187 / 219 » On Computing Explanations in Argumentation |
SAGT
2010
Springer
13 years 8 months ago
2010
Springer
Can learning algorithms find a Nash equilibrium? This is a natural question for several reasons. Learning algorithms resemble the behavior of players in many naturally arising gam...
EMNLP
2010
13 years 8 months ago
2010
Determining whether a textual phrase denotes a functional relation (i.e., a relation that maps each domain element to a unique range element) is useful for numerous NLP tasks such...
ICCBR
2009
Springer
13 years 7 months ago
2009
Springer
Studying examples of expert case-based adaptation could advance computational modeling but only if the examples can be succinctly represented and reliably interpreted. Supreme Cour...
CIM
2011
13 years 4 months ago
2011
We propose to return to the roots of Artificial/Computational Intelligence applicability to board games domain by attempting to mimic human way of playing (or human intelligence ...
CORR
2011
Springer
13 years 4 months ago
2011
Springer
We study algorithmic problems in multi-stage open shop processing systems that are centered around reachability and deadlock detection questions. We characterize safe and unsafe s...