1208 search results - page 147 / 242 » On Counting Generalized Colorings |
133
Voted
EUROPAR
2007
Springer
15 years 9 months ago
2007
Springer
An optimizing compiler has a hard time to generate a code which will perform at top speed for an arbitrary data set size. In general, the low level optimization process must take i...
119
Voted
GECCO
2007
Springer
15 years 9 months ago
2007
Springer
In the classical binary genetic algorithm, although crossover within a building block (BB) does not always cause a decrease in fitness, any decrease in fitness results from the ...
124
click to vote
SOFSEM
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. We consider the problem of maintaining a minimum spanning tree within a graph with dynamically changing edge weights. An online algorithm is confronted with an input sequ...
128
Voted
STACS
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. The perfect matching problem is known to be in ¶, in randomized NC, and it is hard for NL. Whether the perfect matching problem is in NC is one of the most prominent ope...
109
click to vote
MICRO
2006
IEEE
15 years 9 months ago
2006
IEEE
VLIW and EDGE (Explicit Data Graph Execution) architectures rely on compilers to form high-quality hyperblocks for good performance. These compilers typically perform hyperblock f...