Sciweavers

13500 search results - page 289 / 2700
» Improved analysis of D
Sort
View
LPNMR
1997
Springer
15 years 10 months ago
Improving the Alternating Fixpoint: The Transformation Approach
We present a bottom-up algorithm for the computation of the well-founded model of non-disjunctive logic programs which is based on the set of elementary program transformations stu...
Ulrich Zukowski, Burkhard Freitag, Stefan Brass
ASPDAC
2001
ACM
126views Hardware» more  ASPDAC 2001»
15 years 10 months ago
A new partitioning scheme for improvement of image computation
Abstract-- Image computation is the core operation for optimization and formal verification of sequential systems like controllers or protocols. State exploration techniques based ...
Christoph Meinel, Christian Stangier
ESOP
2000
Springer
15 years 10 months ago
Improving the Representation of Infinite Trees to Deal with Sets of Trees
In order to deal efficiently with infinite regular trees (or other pointed graph structures), we give new algorithms to store such structures. The trees are stored in such a way th...
Laurent Mauborgne
FASE
2008
Springer
15 years 8 months ago
Software Quality Improvement Via Pattern Matching
Abstract. Nested if-then-else statements is the most common programming schema in applications like data transformation or data analysis. In most cases, these can be replaced by hi...
Radu Kopetz, Pierre-Etienne Moreau
169
Voted
TSP
2008
96views more  TSP 2008»
15 years 6 months ago
An Improved Adaptive Sidelobe Blanker
We propose a two stage detector consisting of a Subspace Detector (SD) followed by the Whitened Adaptive Beamformer Orthogonal Rejection Test (W-ABORT). The performance analysis sh...
Francesco Bandiera, Olivier Besson, Danilo Orlando...