Sciweavers

Share
8 search results - page 1 / 2
» Exact Bipartite Crossing Minimization under Tree Constraints
Sort
View
WEA
2010
Springer
330views Algorithms» more  WEA 2010»
10 years 9 months ago
Exact Bipartite Crossing Minimization under Tree Constraints
A tanglegram consists of a pair of (not necessarily binary) trees T1, T2 with leaf sets L1, L2. Additional edges, called tangles, may connect nodes in L1 with those in L2. The task...
Frank Baumann, Christoph Buchheim, Frauke Liers
INFORMS
2010
147views more  INFORMS 2010»
9 years 11 months ago
Exact Algorithms for the Quadratic Linear Ordering Problem
The quadratic linear ordering problem naturally generalizes various optimization problems, such as bipartite crossing minimization or the betweenness problem, which includes linear...
Christoph Buchheim, Angelika Wiegele, Lanbo Zheng
CDC
2009
IEEE
189views Control Systems» more  CDC 2009»
10 years 7 months ago
Maximizing aggregated revenue in sensor networks under deadline constraints
Abstract— We study the problem of maximizing the aggregated revenue in sensor networks with deadline constraints. Our model is that of a sensor network that is arranged in the fo...
Srikanth Hariharan, Ness B. Shroff
ISPD
1997
ACM
186views Hardware» more  ISPD 1997»
10 years 6 months ago
EWA: exact wiring-sizing algorithm
The wire sizing problem under inequality Elmore delay constraints is known to be posynomial, hence convex under an exponential variable-transformation. There are formal methods fo...
Rony Kay, Gennady Bucheuv, Lawrence T. Pileggi
DAC
2005
ACM
11 years 3 months ago
Power optimal dual-Vdd buffered tree considering buffer stations and blockages
This paper presents the first in-depth study on applying dual Vdd buffers to buffer insertion and multi-sink buffered tree construction for power minimization under delay constrai...
King Ho Tam, Lei He
books