697 search results - page 25 / 140 » A Study of Evaluation Functions for the Graph K-Coloring Pro... |
IVC
2007
13 years 8 months ago
2007
We introduce a convex relaxation approach for the quadratic assignment problem to the field of computer vision. Due to convexity, a favourable property of this approach is the ab...
CEC
2005
IEEE
13 years 10 months ago
2005
IEEE
The problem of scheduling a parallel program given by a Directed Acyclic Graph (DAG) of tasks is a well-studied area. We present a new approach which employs Differential Evolution...
NIPS
2008
13 years 10 months ago
2008
Many interesting problems, including Bayesian network structure-search, can be cast in terms of finding the optimum value of a function over the space of graphs. However, this fun...
GCB
2009
Springer
14 years 20 days ago
2009
Springer
Abstract: Graphs are often used to describe and analyze the geometry and physicochemical composition of biomolecular structures, such as chemical compounds and protein active sites...
INFOCOM
2002
IEEE
14 years 1 months ago
2002
IEEE
— Various monitoring and performance evaluation tools generate considerable amount of low priority traffic. This information is not always needed in real time, and thus could of...