377 search results - page 29 / 76 » A Fast Heuristic Algorithm for a Probe Mapping Problem |
ASPDAC
2007
ACM
14 years 21 days ago
2007
ACM
- This paper proposes a fast and practical decoupling capacitor (decap) budgeting algorithm to optimize the power ground (P/G) network design. The new method adopts a modified rand...
BICOB
2009
Springer
14 years 3 months ago
2009
Springer
Several applications require the joint display of two phylogenetic trees whose leaves are matched by inter-tree edges. This issue arises, for example, when comparing gene trees and...
GD
2005
Springer
14 years 2 months ago
2005
Springer
In this paper we investigate the problem of drawing metro maps which is defined as follows. Given a planar graph G of maximum degree 8 with its embedding and vertex locations (e.g...
COCOA
2008
Springer
13 years 10 months ago
2008
Springer
A genomic map is represented by a sequence of gene markers, and a gene marker can appear in several different genomic maps, in either positive or negative form. A strip (syntenic b...
CAISE
2006
Springer
14 years 13 days ago
2006
Springer
Recently, schema mapping has found considerable interest in both research and practice. Determining matching components of database or XML schemas is needed in many applications, e...