Sciweavers

2069 search results - page 90 / 414
» Linear time algorithms for Clobber
Sort
View
CORR
2008
Springer
138views Education» more  CORR 2008»
15 years 4 months ago
Efficient Implementation of the Generalized Tunstall Code Generation Algorithm
A method is presented for constructing a Tunstall code that is linear time in the number of output items. This is an improvement on the state of the art for non-Bernoulli sources, ...
Michael B. Baer
COCOA
2010
Springer
15 years 2 months ago
Feasibility-Based Bounds Tightening via Fixed Points
Abstract. The search tree size of the spatial Branch-and-Bound algorithm for Mixed-Integer Nonlinear Programming depends on many factors, one of which is the width of the variable ...
Pietro Belotti, Sonia Cafieri, Jon Lee, Leo Libert...
VIS
2004
IEEE
146views Visualization» more  VIS 2004»
16 years 5 months ago
Tracking of Vector Field Singularities in Unstructured 3D Time-Dependent Datasets
In this paper, we present an approach for monitoring the positions of vector field singularities in time-dependent datasets. The concept of singularity index is discussed and exte...
Christoph Garth, Xavier Tricoche, Gerik Scheuerman...
DAC
2006
ACM
16 years 5 months ago
Criticality computation in parameterized statistical timing
Chips manufactured in 90 nm technology have shown large parametric variations, and a worsening trend is predicted. These parametric variations make circuit optimization difficult ...
Jinjun Xiong, Vladimir Zolotov, Natesan Venkateswa...
RTSS
2005
IEEE
15 years 9 months ago
Voltage Scaling Scheduling for Periodic Real-Time Tasks in Reward Maximization
— This paper is interested in reward maximization of periodic real-time tasks under a given energy constraint, where the reward received depends on how much computation a task ru...
Jian-Jia Chen, Tei-Wei Kuo