697 search results - page 97 / 140 » A Study of Evaluation Functions for the Graph K-Coloring Pro... |
NETWORKING
2007
13 years 9 months ago
2007
Abstract. The topology creation is one of the most important step for the design of an overlay network. Traffic characteristic and volume, and behavior of nodes which can be sel...
ESA
2004
Springer
14 years 1 months ago
2004
Springer
Edge contraction is shown to be a useful mechanism to improve lower bound heuristics for treewidth. A successful lower bound for treewidth is the degeneracy: the maximum over all ...
IEEEPACT
1998
IEEE
13 years 12 months ago
1998
IEEE
Compile-time scheduling is one approach to extract parallelism which has proved effective when the execution behavior is predictable. Unfortunately, the performance of most priori...
TOPLAS
2008
13 years 7 months ago
2008
lem of inferring termination from such abstract information is not the halting problem for programs and may well be decidable. If this is the case, the decision algorithm forms a &...
ISCI
2008
13 years 7 months ago
2008
Evolutionary algorithms (EAs) have been applied with success to many numerical and combinatorial optimization problems in recent years. However, they often lose their effectivenes...