Sciweavers

536 search results - page 46 / 108
» Some Lower Bounds for the Complexity of Continuation Methods
Sort
View
DAM
1999
100views more  DAM 1999»
15 years 1 months ago
Complexity Analysis of Propositional Resolution with Autarky Pruning
An algorithm called Modoc", which has been introduced elsewhere, enhances propositional model elimination with autarky pruning, and other features. The model elimination meth...
Allen Van Gelder
ICASSP
2011
IEEE
14 years 5 months ago
Adaptive frequency-domain biased estimation algorithms with automatic adjustment of shrinkage factors
In this work, we propose adaptive frequency-domain biased estimation algorithms with mechanisms to automatically adjust the shrinkage factors. The proposed estimation algorithms i...
Sheng Li, Rodrigo C. de Lamare, Martin Haardt
FM
2003
Springer
136views Formal Methods» more  FM 2003»
15 years 7 months ago
Improving Safety Assessment of Complex Systems: An Industrial Case Study
The complexity of embedded controllers is steadily increasing. This trend, stimulated by the continuous improvement of the computational power of hardware, demands for a correspond...
Marco Bozzano, Antonella Cavallo, Massimo Cifaldi,...
TSP
2008
115views more  TSP 2008»
15 years 1 months ago
Sinusoidal Modeling and Adaptive Channel Prediction in Mobile OFDM Systems
We propose a wireless fading channel prediction algorithm for a pilot-symbol aided Orthogonal Frequency Division Multiplexing (OFDM) system. Assuming a doubly selective (time and ...
Ian C. Wong, Brian L. Evans
ICCAD
2010
IEEE
124views Hardware» more  ICCAD 2010»
14 years 12 months ago
Symbolic performance analysis of elastic systems
Elastic systems, either synchronous or asynchronous, can be optimized for the average-case performance when they have units with early evaluation or variable latency. The performan...
Marc Galceran Oms, Jordi Cortadella, Michael Kishi...