Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
106
Polynomial Time Synthesis of Byzantine Agreement
- Symposium on Reliable Distributed Systems
, 2001
"... In this paper, we present a polynomial time algorithm for automating the synthesis of a fault-tolerant distributed program from a fault-intolerant distributed program. Since the problem of synthesizing faulttolerant distributed program is NP-hard, we present heuristics that allow us to reduce the ..."
Abstract
-
Cited by 25 (12 self)
- Add to MetaCart
In this paper, we present a polynomial time algorithm for automating the synthesis of a fault-tolerant distributed program from a fault-intolerant distributed program. Since the problem of synthesizing faulttolerant distributed program is NP-hard, we present heuristics that allow us to reduce
Polynomial Time Synthesis of Byzantine Agreement
"... We present a polynomial time algorithm for automatic synthesis of fault-tolerant distributed programs starting from fault-intolerant versions of those programs. Since this synthesis problem is known to be NP-hard, our algorithm relies on heuristics to reduce the complexity. We demonstrate that our a ..."
Abstract
- Add to MetaCart
We present a polynomial time algorithm for automatic synthesis of fault-tolerant distributed programs starting from fault-intolerant versions of those programs. Since this synthesis problem is known to be NP-hard, our algorithm relies on heuristics to reduce the complexity. We demonstrate that our
Information-theoretic limits on sparsity recovery in the high-dimensional and noisy setting
, 2007
"... Abstract—The problem of sparsity pattern or support set recovery refers to estimating the set of nonzero coefficients of an un-3 p known vector 2 based on a set of n noisy observations. It arises in a variety of settings, including subset selection in regression, graphical model selection, signal de ..."
Abstract
-
Cited by 131 (2 self)
- Add to MetaCart
thresholds for support set recovery over the same set of random measurement ensembles using the polynomial-time Lasso method (`1-constrained quadratic programming). Index Terms—Compressed sensing, `1-relaxation, Fano’s method, high-dimensional statistical inference, information-theoretic
Sum of squares relaxations for polynomial semidefinite programming
- Proc. Symp. on Mathematical Theory of Networks and Systems (MTNS
, 2004
"... We present an extension of the scalar polynomial optimization by sum-of squares de-compositions [5] to optimization problems with scalar polynomial objective and polynomial semi-definite constraints. We will show that the values of these relaxations converge to the optimal value under a constraint q ..."
Abstract
-
Cited by 22 (1 self)
- Add to MetaCart
.) The result allows for a systematic improvement of LMI relaxations of non-convex polynomial semi-definite programming problems with guaranteed reduction of the relaxation gap to zero. This can be applied to various very hard control problems that can be written as polynomial semi-definite programs (SDP
T.: Parameter synthesis for polynomial biological models
- In: HSCC 2014
, 2014
"... Parameter determination is an important task in the de-velopment of biological models. In this paper we consider parametric polynomial dynamical systems and address the following parameter synthesis problem: find a set of param-eter values so that the resulting system satisfies a desired property. O ..."
Abstract
-
Cited by 4 (2 self)
- Add to MetaCart
. Our synthesis technique exploits the Bernstein polynomial representation to solve the synthesis problem us-ing linear programming. We apply our framework to two case studies involving epidemic models.
Automated Synthesis of Target-Dependent Programs for Polynomial Evaluation in Fixed-Point Arithmetic
, 2013
"... Abstract—The design of both fast and numerically accurate programs is a real challenge. Thus, the CGPE tool was introduced to assist programmers in synthesizing fast and numerically certified codes in fixed-point arithmetic for the particular case of polynomial evaluation. For performance purposes, ..."
Abstract
- Add to MetaCart
Abstract—The design of both fast and numerically accurate programs is a real challenge. Thus, the CGPE tool was introduced to assist programmers in synthesizing fast and numerically certified codes in fixed-point arithmetic for the particular case of polynomial evaluation. For performance purposes
Automatic Synthesis of Control Programs in Polynomial Time for an Assembly Line
"... The industry wants provably correct and fast formal methods for handling combinatorial dynamical systems. One example of such problems is error recovery in industrial processes. We have used a provably correct, polynomial-time planning algorithm to plan for a miniature assembly line, which assembles ..."
Abstract
- Add to MetaCart
The industry wants provably correct and fast formal methods for handling combinatorial dynamical systems. One example of such problems is error recovery in industrial processes. We have used a provably correct, polynomial-time planning algorithm to plan for a miniature assembly line, which
On Polynomial-Size Programs Winning Finite-State Games
, 1995
"... . Finite-state reactive programs are identified with finite automata which realize winning strategies in Buchi-Landweber games. The games are specified by finite "game graphs" equipped with different winning conditions ("Rabin condition", "Streett condition" and "M ..."
Abstract
-
Cited by 6 (0 self)
- Add to MetaCart
;Muller condition ", defined in analogy to the theory of !-automata). We show that for two classes of games with Muller winning condition polynomials are both an upper and a lower bound for the size of winning reactive programs. Also we give a new proof for the existence of no-memory strategies in games
Results 1 - 10
of
106
