English
Related papers

Related papers: Nondeterminism subject to output commitment in com…

200 papers

The motivation for this work stems from the problem of scheduling requests for flow at supply points along an automated network of open-water channels. The off-take flows are rigid-profile inputs to the system dynamics. In particular, the…

Optimization and Control · Mathematics 2021-01-01 Adair Lang , Michael Cantoni , Farhad Farokhi , Iman Shames

Algorithms which learn environments represented by automata in the past have had complexity scaling with the number of states in the automaton, which can be exponentially large even for automata recognizing regular expressions with a small…

Formal Languages and Automata Theory · Computer Science 2024-05-13 Ali Cataltepe , Vanessa Kosoy

We consider a robust state space filtering problem in the case that the transition probability density is unknown and possibly degenerate. The resulting robust filter has a Kalman-like structure and solves a minimax game: the nature selects…

Optimization and Control · Mathematics 2021-08-26 Shenglun Yi , Mattia Zorzi

Though many safety-critical software systems use floating point to represent real-world input and output, programmers usually have idealized versions in mind that compute with real numbers. Significant deviations from the ideal can cause…

Logic in Computer Science · Computer Science 2018-05-02 Benjamin Sherman , Luke Sciarappa , Adam Chlipala , Michael Carbin

This paper addresses the problem of state and parameter estimation for a class of second-order systems with single output. A new filtered transformation is proposed for the system via dynamic vector and matrix. In this method, the dynamics…

Systems and Control · Computer Science 2018-03-14 Mehdi Tavan , Kamel Sabahi , Saeid Hoseinzadeh

In this paper we present a rule based formalism for filtering variables domains of constraints. This formalism is well adapted for solving dynamic CSP. We take diagnosis as an instance problem to illustrate the use of these rules. A…

Artificial Intelligence · Computer Science 2007-05-23 S. Piechowiak , J. Rodriguez

The discrete-time robust repetitive control (RC, or repetitive controller, also designated RC) problem for nonlinear systems is both challenging and practical. This paper proposes a discrete-time output-feedback RC design for a class of…

Systems and Control · Computer Science 2014-01-09 Quan Quan , Lu Jiang , Kai-Yuan Cai

A recently new intelligent optimization algorithm called discrete state transition algorithm is considered in this study, for solving unconstrained integer optimization problems. Firstly, some key elements for discrete state transition…

Optimization and Control · Mathematics 2016-04-05 Xiaojun Zhou

Nondeterminism in neural network optimization produces uncertainty in performance, making small improvements difficult to discern from run-to-run variability. While uncertainty can be reduced by training multiple model copies, doing so is…

Machine Learning · Computer Science 2021-07-13 Cecilia Summers , Michael J. Dinneen

The design of deterministic filters can be cast as a problem of minimizing an associated cost function for an optimal control problem. Employing the min-plus linearity property of the dynamic programming operator (associated with the…

Optimization and Control · Mathematics 2012-03-28 Srinivas Sridharan

Bloom filters are widely used data structures that compactly represent sets of elements. Querying a Bloom filter reveals if an element is not included in the underlying set or is included with a certain error rate. This membership testing…

Databases · Computer Science 2022-08-08 Angjela Davitkova , Damjan Gjurovski , Sebastian Michel

This paper proposes a novel method for designing finite-horizon discrete-valued switching signals in linear switched systems based on discreteness-promoting regularization. The inherent combinatorial optimization problem is reformulated as…

Optimization and Control · Mathematics 2025-05-06 Masaaki Nagahara , Takuya Ikeda , Ritsuki Hoshimoto

We consider the problem of learning a non-deterministic probabilistic system consistent with a given finite set of positive and negative tree samples. Consistency is defined with respect to strong simulation conformance. We propose learning…

Logic in Computer Science · Computer Science 2012-07-24 Anvesh Komuravelli , Corina S. Pasareanu , Edmund M. Clarke

The state complexity, respectively, nondeterministic state complexity of a regular language $L$ is the number of states of the minimal deterministic, respectively, of a minimal nondeterministic finite automaton for $L$. Some of the most…

Formal Languages and Automata Theory · Computer Science 2026-04-08 Arto Salomaa , Kai Salomaa , Taylor J. Smith

Creating impact in real-world settings requires artificial intelligence techniques to span the full pipeline from data, to predictive models, to decisions. These components are typically approached separately: a machine learning model is…

Machine Learning · Computer Science 2018-11-22 Bryan Wilder , Bistra Dilkina , Milind Tambe

A canonical formalism and constraint analysis for discrete systems subject to a variational action principle are devised. The formalism is equivalent to the covariant formulation, encompasses global and local discrete time evolution moves…

Mathematical Physics · Physics 2013-09-17 Bianca Dittrich , Philipp A Hoehn

In this paper we consider the class of lambda-nondeterministic linear automata as a model of the class of linear languages. As usual in other automata models, lambda-moves do not increase the acceptance power. The main contribution of this…

Formal Languages and Automata Theory · Computer Science 2016-12-01 Benjamín Bedregal

Despite the impressive quality improvements yielded by neural machine translation (NMT) systems, controlling their translation output to adhere to user-provided terminology constraints remains an open problem. We describe our approach to…

Computation and Language · Computer Science 2018-05-11 Eva Hasler , Adrià De Gispert , Gonzalo Iglesias , Bill Byrne

In this paper we consider a nondeterministic computation by deterministic multi-head 2-way automata having a read-only access to an auxiliary memory. The memory contains additional data (a guess) and computation is successful iff it is…

Computational Complexity · Computer Science 2008-11-18 M. N. Vyalyi

Filtering is concerned with the sequential estimation of the state, and uncertainties, of a Markovian system, given noisy observations. It is particularly difficult to achieve accurate filtering in complex dynamical systems, such as those…

Probability · Mathematics 2015-12-14 Wonjung Lee , Andrew Stuart