1332 search results - page 172 / 267 » Combinatorial Algorithms |
195
click to vote
CORR
2011
Springer
15 years 1 months ago
2011
Springer
In Artificial Intelligence with Coalition Structure Generation (CSG) one refers to those cooperative complex problems that require to find an optimal partition, maximising a soci...
140
click to vote
KDD
2009
ACM
16 years 6 months ago
2009
ACM
Given a task T , a pool of individuals X with different skills, and a social network G that captures the compatibility among these individuals, we study the problem of finding X ,...
190
click to vote
FUN
2010
Springer
15 years 11 months ago
2010
Springer
We study the complexity of the popular one player combinatorial game known as Flood-It. In this game the player is given an n×n board of tiles where each tile is allocated one of ...
210
click to vote
NCA
2008
IEEE
15 years 6 months ago
2008
IEEE
The paper focuses on the study of solving the large-scale traveling salesman problem (TSP) based on neurodynamic programming. From this perspective, two methods, temporal differenc...
171
click to vote
KDD
2004
ACM
15 years 11 months ago
2004
ACM
We present a graph-theoretic approach to discover storylines from search results. Storylines are windows that offer glimpses into interesting themes latent among the top search re...