Sciweavers

1332 search results - page 172 / 267
» Combinatorial Algorithms
Sort
View
CORR
2011
Springer
208views Education» more  CORR 2011»
13 years 4 months ago
GRASP and path-relinking for Coalition Structure Generation
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...
Nicola Di Mauro, Teresa Maria Altomare Basile, Ste...
KDD
2009
ACM
216views Data Mining» more  KDD 2009»
14 years 9 months ago
Finding a team of experts in social networks
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 ,...
Theodoros Lappas, Kun Liu, Evimaria Terzi
FUN
2010
Springer
233views Algorithms» more  FUN 2010»
14 years 1 months ago
The Complexity of Flood Filling Games
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 ...
David Arthur, Raphaël Clifford, Markus Jalsen...
NCA
2008
IEEE
13 years 9 months ago
Neurodynamic programming: a case study of the traveling salesman problem
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...
Jia Ma, Tao Yang, Zeng-Guang Hou, Min Tan, Derong ...
KDD
2004
ACM
145views Data Mining» more  KDD 2004»
14 years 2 months ago
A graph-theoretic approach to extract storylines from search results
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...
Ravi Kumar, Uma Mahadevan, D. Sivakumar