Sciweavers

523 search results - page 26 / 105
» On the Signal Bounding Problem in Timing Analysis
Sort
View
ICALP
2004
Springer
15 years 6 months ago
Online Scheduling with Bounded Migration
Consider the classical online scheduling problem where jobs that arrive one by one are assigned to identical parallel machines with the objective of minimizing the makespan. We gen...
Peter Sanders, Naveen Sivadasan, Martin Skutella
TSP
2011
142views more  TSP 2011»
14 years 8 months ago
Fractional QCQP With Applications in ML Steering Direction Estimation for Radar Detection
—This paper deals with the problem of estimating the steering direction of a signal, embedded in Gaussian disturbance, under a general quadratic inequality constraint, representi...
Antonio De Maio, Yongwei Huang, Daniel Pére...
ICCAD
1999
IEEE
125views Hardware» more  ICCAD 1999»
15 years 5 months ago
Direct synthesis of timed asynchronous circuits
This paper presents a new method to synthesize timed asynchronous circuits directly from the specification without generating a state graph. The synthesis procedure begins with a ...
Sung Tae Jung, Chris J. Myers
ISQED
2007
IEEE
152views Hardware» more  ISQED 2007»
15 years 7 months ago
Variation Aware Timing Based Placement Using Fuzzy Programming
In nanometer regime, the effects of variations are having an increasing impact on the delay and power characteristics of devices as well as the yield of the circuit. Statistical t...
Venkataraman Mahalingam, N. Ranganathan
FOCS
2006
IEEE
15 years 7 months ago
Improved Bounds for Online Routing and Packing Via a Primal-Dual Approach
In this work we study a wide range of online and offline routing and packing problems with various objectives. We provide a unified approach, based on a clean primal-dual method...
Niv Buchbinder, Joseph Naor