2631 search results - page 490 / 527 » A Practical Method for the Sparse Resultant |
121
click to vote
STOC
1994
ACM
15 years 1 months ago
1994
ACM
Interactions among agents can be conveniently described by game trees. In order to analyze a game, it is important to derive optimal (or equilibrium) strategies for the di erent p...
ECAI
2006
Springer
15 years 1 months ago
2006
Springer
Abstract. Computational Game Theory is a way to study and evaluate behaviors using game theory models, via agent-based computer simulations. One of the most known example of this a...
113
click to vote
KDD
2010
ACM
15 years 1 months ago
2010
ACM
Constrained clustering has been well-studied for algorithms like K-means and hierarchical agglomerative clustering. However, how to encode constraints into spectral clustering rem...
ATAL
2010
Springer
14 years 11 months ago
2010
Springer
In this paper, we propose a Quantified Distributed Constraint Optimization problem (QDCOP) that extends the framework of Distributed Constraint Optimization problems (DCOPs). DCOP...
GECCO
2008
Springer
14 years 11 months ago
2008
Springer
While recent attempts to search a conceptual software engineering design search space with multi-objective evolutionary algorithms have yielded promising results, the practical ap...