9532 search results - page 180 / 1907 » Logic, Graphs, and Algorithms |
121
click to vote
COCOON
2007
Springer
15 years 10 months ago
2007
Springer
An r-component connected coloring of a graph is a coloring of the vertices so that each color class induces a subgraph having at most r connected components. The concept has been w...
146
click to vote
EVOW
2009
Springer
15 years 11 months ago
2009
Springer
We present a hybrid evolutionary algorithm for the graph coloring problem (Evocol). Evocol is based on two simple-but-effective ideas. First, we use an enhanced crossover that col...
127
click to vote
ICWS
2008
IEEE
15 years 6 months ago
2008
IEEE
In this paper, we have studied a common Web service composition problem, the syntactic matching problem, where the output parameters of a Web service can be used as the input para...
126
click to vote
ALGORITHMICA
2004
15 years 4 months ago
2004
We present a framework for an automated generation of exact search tree algorithms for NP-hard problems. The purpose of our approach is two-fold--rapid development and improved up...
147
click to vote
WEA
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. Many large-scale optimization problems rely on graph theoretic solutions; yet high-performance computing has traditionally focused on regular applications with high degre...