1493 search results - page 217 / 299 » Local resilience of graphs |
105
Voted
HEURISTICS
2006
15 years 20 days ago
2006
This paper investigates the capabilities of the Ant Colony Optimization (ACO) meta-heuristic for solving the maximum clique problem, the goal of which is to find a largest set of ...
95
Voted
IANDC
2006
15 years 20 days ago
2006
Abstract Bigraphs are graphs whose nodes may be nested, representing locality, independently of the edges connecting them. They may be equipped with reaction rules, forming a bigra...
119
click to vote
PAMI
2008
15 years 18 days ago
2008
Hierarchical clustering is a stepwise clustering method usually based on proximity measures between objects or sets of objects from a given data set. The most common proximity meas...
83
Voted
TIT
2008
15 years 17 days ago
2008
The problem of computing functions of values at the nodes in a network in a fully distributed manner, where nodes do not have unique identities and make decisions based only on loc...
JCP
2007
15 years 17 days ago
2007
ADE, autonomic distributed environment, is a system which engages autonomic elements to automatically take an existing centralized application and distribute it across available re...