Sciweavers

361 search results - page 57 / 73
» Approximate counting by dynamic programming
Sort
View
JCB
2002
111views more  JCB 2002»
13 years 7 months ago
A General Edit Distance between RNA Structures
Arc-annotated sequences are useful in representing the structural information of RNA sequences. In general, RNA secondary and tertiary structures can be represented as a set of ne...
Tao Jiang, Guohui Lin, Bin Ma, Kaizhong Zhang
INFOCOM
2010
IEEE
13 years 6 months ago
Max-Contribution: On Optimal Resource Allocation in Delay Tolerant Networks
—This is by far the first paper considering joint optimization of link scheduling, routing and replication for disruption-tolerant networks (DTNs). The optimization problems for...
Kyunghan Lee, Yung Yi, Jaeseong Jeong, Hyungsuk Wo...
CDC
2010
IEEE
210views Control Systems» more  CDC 2010»
13 years 2 months ago
Advances in moving horizon estimation for nonlinear systems
In the past decade, moving horizon estimation (MHE) has emerged as a powerful technique for estimating the state of a dynamical system in the presence of nonlinearities and disturb...
Angelo Alessandri, Marco Baglietto, Giorgio Battis...
LCTRTS
2007
Springer
14 years 1 months ago
Tetris: a new register pressure control technique for VLIW processors
The run-time performance of VLIW (very long instruction word) microprocessors depends heavily on the effectiveness of its associated optimizing compiler. Typical VLIW compiler pha...
Weifeng Xu, Russell Tessier
ISPD
2012
ACM
288views Hardware» more  ISPD 2012»
12 years 3 months ago
Construction of realistic gate sizing benchmarks with known optimal solutions
Gate sizing in VLSI design is a widely-used method for power or area recovery subject to timing constraints. Several previous works have proposed gate sizing heuristics for power ...
Andrew B. Kahng, Seokhyeong Kang