1218 search results - page 240 / 244 » The many facets of natural computing |
CORR
2010
Springer
14 years 10 months ago
2010
Springer
Finding approximate Nash equilibria in n × n bimatrix games is currently one of the main open problems in algorithmic game theory. Motivated in part by the lack of progress on wo...
108
Voted
JACM
2010
14 years 10 months ago
2010
Description logics (DLs) and rules are formalisms that emphasize different aspects of knowledge representation: whereas DLs are focused on specifying and reasoning about conceptual...
104
click to vote
JAIR
2010
14 years 10 months ago
2010
In the usual models of cooperative game theory, the outcome of a coalition formation process is either the grand coalition or a coalition structure that consists of disjoint coali...
KDD
2010
ACM
14 years 10 months ago
2010
ACM
Malware categorization is an important problem in malware analysis and has attracted a lot of attention of computer security researchers and anti-malware industry recently. Todayâ...
113
Voted
SAGT
2010
Springer
14 years 10 months ago
2010
Springer
Abstract. One reason for wanting to compute an (approximate) Nash equilibrium of a game is to predict how players will play. However, if the game has multiple equilibria that are f...