697 search results - page 28 / 140 » A Study of Evaluation Functions for the Graph K-Coloring Pro... |
AMAI
2004
Springer
14 years 2 months ago
2004
Springer
We study three new techniques which will speed up the branch-and-bound algorithm for the MAX-2-SAT problem: The first technique is a new lower bound function for the algorithm an...
KDD
2010
ACM
13 years 7 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, ...
ICC
2007
IEEE
14 years 3 months ago
2007
IEEE
—The paper analyzes the performance of the bandwidth allocation process over satellite communication systems in presence of specific Quality of Service (QoS) requirements. The re...
TVCG
2008
13 years 9 months ago
2008
Abstract-- A typical data-driven visualization of electroencephalography (EEG) coherence is a graph layout, with vertices representing electrodes and edges representing significant...
CEC
2005
IEEE
14 years 2 months ago
2005
IEEE
This paper presents a study on Hierarchical Surrogate-Assisted Evolutionary Algorithm (HSAEA) using different global surrogate models for solving computationally expensive optimiza...