Results 1 to 10 of about 394,891 (265)
Transforming Undecidable Synthesis Problems into Decidable Problems
EPiC Series in Computing, 2018 Synthesis holds the promise to revolutionize the development ofcomplex systems by automating the translation from specifications toimplementations. Synthesis algorithms are based on the same level ofmathematical rigor as verification algorithms but can ...
Bernd Finkbeiner
core +3 more sources
Application of Convex Relaxation to Array Synthesis Problems
IEEE Transactions on Antennas and Propagation, 2014 International audienceA general procedure to solve efficiently non convex array synthesis problems is presented. It is based on the SemiDefinite Relaxation (SDR) technique.
Benjamin Fuchs
exaly +3 more sources
Evolutionary Synthesis of HVAC System Configurations: Algorithm Development. [PDF]
, 2008 This paper describes the development of an optimization procedure for the synthesis of novel heating, ventilating, and air-conditioning (HVAC) system configurations. Novel HVAC system designs can be synthesized using model-based optimization methods. The
Angelov, Plamen +14 more
core +1 more source
On a Local Darlington Synthesis Problem [PDF]
Complex Analysis and Operator Theory, 2017 The Darlington synthesis problem (in the scalar case) is the problem of embedding a given contractive analytic function to an inner $2\times 2$ matrix function as the entry. A fundamental result of Arov--Douglas--Helton relates this algebraic property to a pure analytic one known as a pseudocontinuation of bounded type.
openaire +2 more sources
Total synthesis of (-)-pyridovericin and synthetic studies towards aetheramide B [PDF]
, 2015 In this thesis, two projects involving the total synthesis of natural products are presented. The first part gives an overview on neurodegenerative diseases and introduces the neuritogenic pyridopolyene natural product (–)-pyridovericin.
Schmid, Fabian Felix
core +1 more source
Encoding of Planning Problems and Their Optimizations in Linear Logic [PDF]
, 2009 Girard’s Linear Logic is a formalism which can be used to manage a lot of problems with consumable resources. Its expressiveness is quite good for an easily understandable encoding of many problems.
Chrpa, Lukáš +5 more
core +1 more source
CoRRWe study a generalisation of Büchi-Landweber games to the timed setting. The winning condition is specified by a non-deterministic timed automaton, and one of the players can elapse time. We perform a systematic study of synthesis problems in all variants of timed games, depending on which player's winning condition is specified, and which player's ...
Lasota, Sławomir +3 more
openaire +3 more sources
New computational paradigms in solving fault detection and isolation problems
, 2012 Several fault detection and isolation problems are formulated for linear time-invariant systems with additive faults and general existence conditions of their solutions are given.
Varga, Andreas
core +1 more source
The Church Synthesis Problem with Parameters [PDF]
Logical Methods in Computer Science, 2007 For a two-variable formula ψ(X,Y) of Monadic Logic of Order (MLO) the Church Synthesis Problem concerns the existence and construction of an operator Y=F(X) such that ψ(X,F(X)) is universally valid over Nat. B\"{u}chi and Landweber proved that the Church synthesis problem is decidable; moreover, they showed that if there is an ...
openaire +3 more sources
An electrochemical approach to selective oligosaccharide synthesis
, 2004 This thesis describes investigations into the use of electrochemical oxidation as a method for the activation of glycosyl donors, and in particular the application of this technique to the selective activation of one electrochemically active glycoside ...
France, Robert
core +1 more source