Sciweavers

4340 search results - page 524 / 868
» Formal Methods and Cryptography
Sort
View
CPM
2005
Springer
116views Combinatorics» more  CPM 2005»
16 years 7 days ago
Exact and Approximation Algorithms for DNA Tag Set Design
In this paper we propose new solution methods for designing tag sets for use in universal DNA arrays. First, we give integer linear programming formulations for two previous formal...
Ion I. Mandoiu, Dragos Trinca
FMCO
2005
Springer
16 years 6 days ago
A Software Component Model and Its Preliminary Formalisation
A software component model should define what components are, and how they can be composed. That is, it should define a theory of components and their composition. Current softwa...
Kung-Kiu Lau, Mario Ornaghi, Zheng Wang
HYBRID
2005
Springer
16 years 6 days ago
Controller Synthesis on Non-uniform and Uncertain Discrete-Time Domains
Abstract. The problem of synthesizing feedback controllers that perform sensing and actuation actions on non–uniform and uncertain discrete time domains is considered. This class...
Andrea Balluchi, Pierpaolo Murrieri, Alberto L. Sa...
VLBV
2005
Springer
16 years 5 days ago
Efficient Digital Pre-filtering for Least-Squares Linear Approximation
In this paper we propose a very simple FIR pre-filter based method for near optimal least-squares linear approximation of discrete time signals. A digital pre-processing filter,...
Marco Dalai, Riccardo Leonardi, Pierangelo Miglior...
FMCAD
2004
Springer
16 years 2 days ago
Approximate Symbolic Model Checking for Incomplete Designs
We consider the problem of checking whether an incomplete design can still be extended to a complete design satisfying a given CTL formula and whether the property is satisfied fo...
Tobias Nopper, Christoph Scholl