1986 search results - page 272 / 398 » Path Separability of Graphs |
134
Voted
HCW
1999
IEEE
15 years 6 months ago
1999
IEEE
A major challenge in Metacomputing Systems (Computational Grids) is to effectively use their shared resources, such as compute cycles, memory, communication network, and data repo...
150
Voted
MLMTA
2007
15 years 4 months ago
2007
— Cluster Ensembles is a framework for combining multiple partitionings obtained from separate clustering runs into a final consensus clustering. This framework has attracted mu...
131
Voted
DEXA
2010
Springer
15 years 2 months ago
2010
Springer
Given a spatio-temporal network (ST network) whose edge properties vary with time, a time-sub-interval minimum spanning tree (TSMST) is a collection of distinct minimum spanning t...
114
click to vote
AI
2007
Springer
15 years 2 months ago
2007
Springer
We present a formal, mathematical model of argument structure and evaluation, taking seriously the procedural and dialogical aspects of argumentation. The model applies proof stan...
134
Voted
MP
2010
14 years 9 months ago
2010
In many practical applications, the task is to optimize a non-linear objective function over the vertices of a well-studied polytope as, e.g., the matching polytope or the travelli...