351 search results - page 37 / 71 » An exact method for graph coloring |
GECCO
2009
Springer
14 years 2 months ago
2009
Springer
Hyper-heuristics can be thought of as “heuristics to choose heuristics”. They are concerned with adaptively finding solution methods, rather than directly producing a solutio...
IPPS
1994
IEEE
13 years 12 months ago
1994
IEEE
Many algorithms to schedule DAGs on multiprocessors have been proposed, but there has been little work done to determine their effectiveness. Since multi-processor scheduling is a...
NIPS
2008
13 years 9 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...
GRAPHICSINTERFACE
2000
13 years 9 months ago
2000
In this paper, we present an efficient way to denoise bivariate data like height fields, color pictures or vector fields, while preserving edges and other features. Mixing surface...
ICCAD
2007
IEEE
14 years 4 months ago
2007
IEEE
— Computing counterexamples is a crucial task for error diagnosis and debugging of sequential systems. If an implementation does not fulfill its specification, counterexamples ...