Sciweavers

1218 search results - page 240 / 244
» The many facets of natural computing
Sort
View
CORR
2010
Springer
164views Education» more  CORR 2010»
14 years 8 months ago
Approximate Nash Equilibria under Stability Conditions
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...
Maria-Florina Balcan, Mark Braverman
JACM
2010
137views more  JACM 2010»
14 years 7 months ago
Reconciling description logics and rules
Description logics (DLs) and rules are formalisms that emphasize different aspects of knowledge representation: whereas DLs are focused on specifying and reasoning about conceptual...
Boris Motik, Riccardo Rosati
88
Voted
JAIR
2010
106views more  JAIR 2010»
14 years 7 months ago
Cooperative Games with Overlapping Coalitions
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...
Georgios Chalkiadakis, Edith Elkind, Evangelos Mar...
KDD
2010
ACM
304views Data Mining» more  KDD 2010»
14 years 7 months ago
Automatic malware categorization using cluster ensemble
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â...
Yanfang Ye, Tao Li, Yong Chen, Qingshan Jiang
SAGT
2010
Springer
164views Game Theory» more  SAGT 2010»
14 years 7 months ago
On Nash-Equilibria of Approximation-Stable Games
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...
Pranjal Awasthi, Maria-Florina Balcan, Avrim Blum,...