Related papers: $\omega$-Regular Energy Problems
A coarse-grained quantum operator technique is used along with the formalism of Bohmian mechanics endowed with stochastic character at the quantum level in order to address some central issues in the quantum theory of measurement. A…
We describe a software framework for solving user equilibrium traffic assignment problems. The design is based on the formulation of the problem as a variational inequality. The software implements these as well as several numerical methods…
We establish local and global well-posedness for the Cauchy problem of a generalized Camassa-Holm equation where orders of the momentum and the nonlinearity can be arbitrarily high. More precisely, we consider the equation \begin{equation*}…
An operational description of the controlled Markov dynamics of quantum-mechanical system is introduced. The feedback control strategies with regard to the dynamical reduction of quantum states in the course of quantum real-time…
In decision-making under uncertainty, several criteria have been studied to aggregate the performance of a solution over multiple possible scenarios. This paper introduces a novel variant of ordered weighted averaging (OWA) for optimization…
We introduce a weight assignment logic for reasoning about quantitative languages of infinite words. This logic is an extension of the classical MSO logic and permits to describe quantitative properties of systems with multiple weight…
Linear-parametric optimization, where multiple objectives are combined into a single objective using linear combinations with parameters as coefficients, has numerous links to other fields in optimization and a wide range of application…
We suggest solving the measurement problem by postulating the existence of a special future final boundary condition for the universe. Although this is an extension of the way boundary conditions are usually chosen (in terrestrial…
The precise complexity of complementing B\"uchi automata is an intriguing and long standing problem. While optimal complementation techniques for finite automata are simple - it suffices to determinize them using a simple subset…
We introduce a synthetic approach to global pluripotential theory, covering in particular the case of a compact K\"ahler manifold and that of a projective Berkovich space over a non-Archimedean field. We define and study the space of…
We follow a connection between tight determinisation and complementation and establish a complementation procedure from parity automata to nondeterministic B\"uchi automata and prove it to be tight up to an $O(n)$ factor, where $n$ is the…
We propose a novel Bayesian Optimization approach for black-box functions with an environmental variable whose value determines the tradeoff between evaluation cost and the fidelity of the evaluations. Further, we use a novel approach to…
We obtain a measure representation for a functional arising in the context of optimal design problems under linear growth conditions. The functional in question corresponds to the relaxation with respect to a pair $(\chi,u)$, where $\chi$…
Prediction models are often employed in estimating parameters of optimization models. Despite the fact that in an end-to-end view, the real goal is to achieve good optimization performance, the prediction performance is measured on its own.…
We address a broad class of optimization problems of finding quantum measurements, which includes the problems of finding an optimal measurement in the Bayes criterion and a measurement maximizing the average success probability with a…
In this paper, we present efficient quantum algorithms that are exponentially faster than classical algorithms for solving the quantum optimal control problem. This problem involves finding the control variable that maximizes a physical…
The growing uncertainty from renewable power and electricity demand brings significant challenges to unit commitment (UC). While various advanced forecasting and optimization methods have been developed to predict better and address this…
An efficient quantum algorithm is proposed to solve in polynomial time the parity problem, one of the hardest problems both in conventional quantum computation and in classical computation, on NMR quantum computers. It is based on the…
In this paper, we first introduce a lower bound technique for the state complexity of transformations of automata. Namely we suggest first considering the class of full automata in lower bound analysis, and later reducing the size of the…
When deploying a single predictor across multiple subpopulations, we propose a fundamentally different approach: interpreting group fairness as a bargaining problem among subpopulations. This game-theoretic perspective reveals that existing…