798 search results - page 58 / 160 » Engineering graph clustering: Models and experimental evalua... |
166
click to vote
KDD
2010
ACM
15 years 4 months ago
2010
ACM
Assume a network (V, E) where a subset of the nodes in V are active. We consider the problem of selecting a set of k active nodes that best explain the observed activation state, ...
168
click to vote
AVI
2008
15 years 8 months ago
2008
Many critical decisions for individuals and organizations are often framed as preferential choices: the process of selecting the best option out of a set of alternatives. This pap...
158
click to vote
TPDS
2008
15 years 5 months ago
2008
We present the Network File System with Cluster Delegation (NFS-CD), an enhancement to the NFSv4 that reduces server load and increases the scalability of distributed file systems ...
161
click to vote
SOCO
2010
Springer
2010
Springer
Evaluating a local genetic algorithm as context-independent local search operator for metaheuristics
15 years 4 months ago
Local genetic algorithms have been designed with the aim of providing effective intensiļ¬cation. One of their most outstanding features is that they may help classical local searc...
146
click to vote
IJCAI
2001
15 years 7 months ago
2001
The progressive processing model allows a system to trade off resource consumption against the quality of the outcome by mapping each activity to a graph of potential solution met...