中文
相关论文

相关论文: Compliant Conditions for Polynomial Time Approxima…

200 篇论文

Time series of counts arise in a variety of forecasting applications, for which traditional models are generally inappropriate. This paper introduces a hierarchical Bayesian formulation applicable to count time series that can easily…

机器学习 · 统计学 2014-05-16 Nicolas Chapados

Positive polynomial operator that approximates Urison operator, when integration domain is a "regular triangle" is investigated. We obtain Bernstein Polynomials as a particular case.

数值分析 · 数学 2011-10-31 Volodymyr Makarov , Ihor Demkiv

Lagrangian relaxation is a versatile mathematical technique employed to relax constraints in an optimization problem, enabling the generation of dual bounds to prove the optimality of feasible solutions and the design of efficient…

人工智能 · 计算机科学 2023-12-25 Augustin Parjadis , Quentin Cappart , Bistra Dilkina , Aaron Ferber , Louis-Martin Rousseau

In this paper we show how to compute algorithmically the full set of algebraically independent constraints for singular mechanical and field-theoretical models with polynomial Lagrangians. If a model under consideration is not singular as a…

动力系统 · 数学 2017-03-01 Vladimir P. Gerdt , Daniel Robertz

We examine two different ways of encoding a counting function, as a rational generating function and explicitly as a function (defined piecewise using the greatest integer function). We prove that, if the degree and number of input…

组合数学 · 数学 2015-05-08 Sven Verdoolaege , Kevin Woods

Systems subjected to holonomic constraints follow quite complicated dynamics that could not be described easily with Hamiltonian or Lagrangian dynamics. The influence of holonomic constraints in equations of motions is taken into account by…

统计力学 · 物理学 2010-09-08 Martial Mazars

We show that multiplication can be done in polynomial time on a three counter machine that receives its input as the contents of two counters. The technique is generalized to functions of two variables computable by deterministic Turing…

计算复杂性 · 计算机科学 2015-01-12 Holger Petersen

We give a {\em deterministic} algorithm for approximately computing the fraction of Boolean assignments that satisfy a degree-$2$ polynomial threshold function. Given a degree-2 input polynomial $p(x_1,\dots,x_n)$ and a parameter $\eps >…

计算复杂性 · 计算机科学 2013-11-28 Anindya De , Ilias Diakonikolas , Rocco A. Servedio

In a facility with front room and back room operations, it is useful to switch workers between the rooms in order to cope with changing customer demand. Assuming stochastic customer arrival and service times, we seek a policy for switching…

人工智能 · 计算机科学 2011-11-02 Daria Terekhov , J. Christopher Beck

The mathematical framework of hybrid system is a recent and general tool to treat control systems involving control action of heterogeneous nature. In this paper, we construct and test a semi-Lagrangian numerical scheme for solving the…

数值分析 · 数学 2016-08-03 Roberto Ferretti , Achille Sassi

This paper studies the compression of partial differential operators using neural networks. We consider a family of operators, parameterized by a potentially high-dimensional space of coefficients that may vary on a large range of scales.…

数值分析 · 数学 2022-03-29 Fabian Kröpfl , Roland Maier , Daniel Peterseim

The octagon abstract domain is a widely used numeric abstract domain expressing relational information between variables whilst being both computationally efficient and simple to implement. Each element of the domain is a system of…

编程语言 · 计算机科学 2017-11-01 Aziem Chawdhary , Ed Robbins , Andy King

We consider a framework for the construction of iterative schemes for operator equations that combine low-rank approximation in tensor formats and adaptive approximation in a basis. Under fairly general assumptions, we obtain a rigorous…

数值分析 · 数学 2014-03-17 Markus Bachmayr , Wolfgang Dahmen

Constrained blackbox optimization is a difficult problem, with most approaches coming from the mathematical programming literature. The statistical literature is sparse, especially in addressing problems with nontrivial constraints. This…

We introduce certain linear positive operators and study some approximation properties of these operators in the space of functions, continuous on a compact set, of two variables. We also find the order of this approximation by using…

经典分析与常微分方程 · 数学 2007-09-24 Fatma Tasdelen , Ali Olgun , Gulen Bascanbaz-Tunca

Path integral formulations for gauge theories must start from the canonical formulation in order to obtain the correct measure. A possible avenue to derive it is to start from the reduced phase space formulation. In this article we review…

广义相对论与量子宇宙学 · 物理学 2010-11-01 Muxin Han , Thomas Thiemann

This paper introduces a more restrictive notion of feasibility of functionals on Baire space than the established one from second-order complexity theory. Thereby making it possible to consider functions on the natural numbers as running…

计算复杂性 · 计算机科学 2017-06-02 Akitoshi Kawamura , Florian Steinberg

We present the symplectic algorithm in the Lagrangian formalism for the Hamiltonian systems by virtue of the noncommutative differential calculus with respect to the discrete time and the Euler--Lagrange cohomological concepts. We also show…

计算物理 · 物理学 2007-05-23 H. Y. Guo , Y. Q. Li , K. Wu

Simulating the dynamics of complex quantum systems is a central application of quantum devices. Here, we propose leveraging the power of measurements to simulate short-time quantum dynamics of physically prepared quantum states in classical…

量子物理 · 物理学 2025-07-02 Paul K. Faehrmann , Jens Eisert , Maria Kieferova , Richard Kueng

Before we proposed an algebraic technics for the Hamiltonian approach to the evolution systems of partial differential equations, including systems with constraints. Here we further develop this approach and present the defining system of…

数学物理 · 物理学 2018-03-13 Victor Zharinov