Sciweavers

21 search results - page 2 / 5
» Dynamic Programming to Minimize the Maximum Number of Open S...
Sort
View
JCO
2011
115views more  JCO 2011»
12 years 12 months ago
Approximation scheme for restricted discrete gate sizing targeting delay minimization
Discrete gate sizing is a critical optimization in VLSI circuit design. Given a set of available gate sizes, discrete gate sizing problem asks to assign a size to each gate such th...
Chen Liao, Shiyan Hu
CDC
2009
IEEE
124views Control Systems» more  CDC 2009»
13 years 6 months ago
Inverse modeling for open boundary conditions in channel network
Abstract-- An inverse modeling problem for systems governed by first-order, hyperbolic partial differential equations subject to periodic forcing is investigated. The problem is de...
Qingfang Wu, Mohammad Rafiee, Andrew Tinka, Alexan...
HOTSWUP
2009
ACM
13 years 8 months ago
Efficient Systematic Testing for Dynamically Updatable Software
Recent years have seen significant advances in dynamic software updating (DSU) systems, which allow programs to be patched on the fly. However, a significant challenge remains: Ho...
Christopher M. Hayden, Eric A. Hardisty, Michael W...
LION
2007
Springer
138views Optimization» more  LION 2007»
13 years 11 months ago
A Continuous Characterization of Maximal Cliques in k-Uniform Hypergraphs
Abstract. In 1965 Motzkin and Straus established a remarkable connection between the local/global maximizers of the Lagrangian of a graph G over the standard simplex ∆ and the ma...
Samuel Rota Bulò, Marcello Pelillo
BMCBI
2010
112views more  BMCBI 2010»
13 years 5 months ago
A parameter-adaptive dynamic programming approach for inferring cophylogenies
Background: Coevolutionary systems like hosts and their parasites are commonly used model systems for evolutionary studies. Inferring the coevolutionary history based on given phy...
Daniel Merkle, Martin Middendorf, Nicolas Wieseke