Sciweavers

1885 search results - page 242 / 377
» Optimization of Component Connections for an Embedded Compon...
Sort
View
CPM
1999
Springer
129views Combinatorics» more  CPM 1999»
15 years 9 months ago
On the Structure of Syntenic Distance
This paper examines some of the rich structure of the syntenic distance model of evolutionary distance, introduced by Ferretti et al. (1996). The syntenic distance between two gen...
David Liben-Nowell
CLASSIFICATION
2008
68views more  CLASSIFICATION 2008»
15 years 4 months ago
The Metric Cutpoint Partition Problem
Let G = (V, E, w) be a graph with vertex and edge sets V and E, respectively, and w : E IR+ a function which assigns a positive weight or length to each edge of G. G is called a r...
Alain Hertz, Sacha Varone
ENTCS
2008
138views more  ENTCS 2008»
15 years 4 months ago
Compositionality of Statically Scheduled IP
Timing Closure in presence of long global wire interconnects is one of the main current issues in System-onChip design. One proposed solution to the Timing Closure problem is Late...
Julien Boucaron, Jean-Vivien Millo
GECCO
2006
Springer
148views Optimization» more  GECCO 2006»
15 years 8 months ago
An effective genetic algorithm for the minimum-label spanning tree problem
Given a connected, undirected graph G with labeled edges, the minimum-label spanning tree problem seeks a spanning tree on G to whose edges are attached the smallest possible numb...
Jeremiah Nummela, Bryant A. Julstrom
CORR
2010
Springer
198views Education» more  CORR 2010»
15 years 1 months ago
Convex Graph Invariants
The structural properties of graphs are usually characterized in terms of invariants, which are functions of graphs that do not depend on the labeling of the nodes. In this paper ...
Venkat Chandrasekaran, Pablo A. Parrilo, Alan S. W...