36 search results - page 2 / 8 » Improving Graph Colouring Algorithms and Heuristics Using a ... |
FPL
2000
Springer
13 years 9 months ago
2000
Springer
This paper describes a novel resource binding technique for use in multiple-wordlength systems implemented in FPGAs. It is demonstrated that the multiple-wordlength binding problem...
ASPDAC
2009
ACM
13 years 12 months ago
2009
ACM
—Reversible logic studies have promising potential on energy lossless circuit design, quantum computation, nanotechnology, etc. Reversible logic features a one-to-one input outpu...
IPPS
2005
IEEE
13 years 11 months ago
2005
IEEE
We propose in this paper a heuristic for mapping a set of interacting tasks of a parallel application onto a heterogeneous computing platform such as a computational grid. Our nov...
GECCO
2007
Springer
13 years 11 months ago
2007
Springer
In this paper, a model based on genetic algorithms for protein folding prediction is proposed. The most important features of the proposed approach are: i) Heuristic secondary str...
ICCAD
2001
IEEE
14 years 2 months ago
2001
IEEE
Methods based on Boolean satisfiability (SAT) typically use a Conjunctive Normal Form (CNF) representation of the Boolean formula, and exploit the structure of the given problem ...