1332 search results - page 87 / 267 » Combinatorial Algorithms |
JDA
2008
13 years 8 months ago
2008
Abstract. Genome rearrangement algorithms are powerful tools to analyze gene orders in molecular evolution. Analysis of genomes evolving by reversals and transpositions leads to a ...
RECOMB
2010
Springer
13 years 7 months ago
2010
Springer
Chaining fragments is a crucial step in genome alignment. Existing chaining algorithms compute a maximum weighted chain with no overlaps allowed between adjacent fragments. In prac...
WSC
1998
13 years 10 months ago
1998
Heuristics are an increasingly popular solution method for combinatorial optimization problems. Heuristic use often frees the modeler from some of the restrictions placed on class...
DAC
1996
ACM
14 years 1 months ago
1996
ACM
Abstract -- This paper introduces a new HW/SW partitioning algorithm used in automating the instruction set processor design for pipelined ASIP (Application Specific Integrated Pro...
SETN
2010
Springer
14 years 1 months ago
2010
Springer
The optimal sizing of a small autonomous hybrid power system can be a very challenging task, due to the large number of design settings and the uncertainty in key parameters. This ...