Sciweavers

866 search results - page 102 / 174
» Algorithms for Comparing Pedigree Graphs
Sort
View
SYNASC
2005
IEEE
129views Algorithms» more  SYNASC 2005»
14 years 2 months ago
Logic Restructuring for Delay Balancing in Wave-Pipelined Circuits: An Integer Programming Approach
In this paper we apply integer programming (IP) based techniques to the problem of delay balancing in wave-pipelined circuits. The proposed approach considers delays, as well as f...
Srivastav Sethupathy, Nohpill Park, Marcin Paprzyc...
GCB
2004
Springer
92views Biometrics» more  GCB 2004»
14 years 2 months ago
Syntenic Layout of Two Assemblies of Related Genomes
: To facilitate research in comparative genomics, sequencing projects are increasingly aimed at assembling the genomes of closely related organisms. Given two incomplete assemblies...
Olaf Delgado Friedrichs, Aaron L. Halpern, Ross Li...
ISLPED
1995
ACM
100views Hardware» more  ISLPED 1995»
14 years 24 days ago
Simultaneous scheduling and binding for power minimization during microarchitecture synthesis
ABSTRACT { Sub-micron technologies and the increasing size and complexity of integrated components have aggravated the e ect of long interconnects and buses, compared to that of ga...
Aurobindo Dasgupta, Ramesh Karri
EUROGP
2008
Springer
135views Optimization» more  EUROGP 2008»
13 years 11 months ago
Using Genetic Programming for Turing Machine Induction
Abstract. Turing machines are playing an increasingly significant role in Computer Science domains such as bioinformatics. Instead of directly formulating a solution to a problem, ...
Amashini Naidoo, Nelishia Pillay
TCS
2008
13 years 9 months ago
Digraph measures: Kelly decompositions, games, and orderings
We consider various well-known, equivalent complexity measures for graphs such as elimination orderings, k-trees and cops and robber games and study their natural translations to ...
Paul Hunter, Stephan Kreutzer