Sciweavers

21 search results - page 4 / 5
» Optimal Coalition Structure Generation In Partition Function...
Sort
View
SAGT
2010
Springer
202views Game Theory» more  SAGT 2010»
13 years 3 months ago
Computing Stable Outcomes in Hedonic Games
We study the computational complexity of finding stable outcomes in symmetric additively-separable hedonic games. These coalition formation games are specified by an undirected e...
Martin Gairing, Rahul Savani
ATAL
2010
Springer
13 years 6 months ago
A distributed algorithm for anytime coalition structure generation
A major research challenge in multi-agent systems is the problem of partitioning a set of agents into mutually disjoint coalitions, such that the overall performance of the system...
Tomasz P. Michalak, Jacek Sroka, Talal Rahwan, Mic...
GECCO
2008
Springer
179views Optimization» more  GECCO 2008»
13 years 6 months ago
Developing neural structure of two agents that play checkers using cartesian genetic programming
A developmental model of neural network is presented and evaluated in the game of Checkers. The network is developed using cartesian genetic programs (CGP) as genotypes. Two agent...
Gul Muhammad Khan, Julian Francis Miller, David M....
VMV
2003
151views Visualization» more  VMV 2003»
13 years 6 months ago
Optimized Spatial Hashing for Collision Detection of Deformable Objects
We propose a new approach to collision and self– collision detection of dynamically deforming objects that consist of tetrahedrons. Tetrahedral meshes are commonly used to repre...
Matthias Teschner, Bruno Heidelberger, Matthias M&...
IEEECIT
2005
IEEE
13 years 11 months ago
Case Study: Distance-Based Image Retrieval in the MoBIoS DBMS
Similarity search leveraging distance-based index structures is increasingly being used for complex data types. It has been shown that for high dimensional uniform vectors with si...
Rui Mao, Wenguo Liu, Daniel P. Miranker, Qasim Iqb...