Results 11 to 20 of about 76,024 (266)
Minimax Approximations Subject to a Constraint [PDF]
Mathematics of Computation, 1971 A class of approximation problems is considered in which a continuous, positive function φ
Fike, C. T., Sterbenz, P. H.
openaire +2 more sources
Engineering Proceedings, 2023 Environmental demands around the world have led to an increasing interest in natural gas due to its advantages over other hydrocarbons used in power generation, which has led to the search for the best way to solve the transportation problem associated ...
Cristian Alejandro Blanco-Martínez +4 more
doaj +1 more source
Improved Combinatorial Approximations for Weighted Correlation Clustering [PDF]
Discrete Mathematics & Theoretical Computer ScienceWe present combinatorial approximation algorithms for the weighted correlation clustering problem. In this problem, we have a set of vertices and two weight values for each pair of vertices, denoting their difference and similarity.
Mojtaba Ostovari, Alireza Zarei
doaj +1 more source
Zhongguo dianli, 2023 Optimization of coal procurement and inventory for power generation enterprises are of great significance for guaranteeing power supply and ensuring generation income.
Li YAO +5 more
doaj +1 more source
Consistency of Approximation of Bernstein Polynomial-Based Direct Methods for Optimal Control
Machines, 2022 Bernstein polynomial approximation of continuous function has a slower rate of convergence compared to other approximation methods. “The fact seems to have precluded any numerical application of Bernstein polynomials from having been made.
Venanzio Cichella +4 more
doaj +1 more source
IET Smart Grid, 2020 As the core sub-problem of both network reconfiguration and service restoration of the electrical distribution system (EDS), the load pick-up (LPP) problem in EDS searches the optimal configuration of the EDS, aiming to minimise the power loss or provide
Jingyang Yun +6 more
doaj +1 more source
Remarks on Artin approximation with constraints
Osaka Journal of Mathematics, 2017 We study various approximation results of solutions of equations $f(x,Y)=0$ where $f(x,Y)\in\mathbb K[[x]][Y]^r$ and $x$ and $Y$ are two sets of variables, and where some components of the solutions $y(x)\in\mathbb K[[x]]^m$ do not depend on all the variables $x_j$. These problems have been highlighted by M. Artin.
Popescu, Dorin, Rond, Guillaume
openaire +6 more sources
Approximation method of multiple consistency constraint under differential privacy
Tongxin xuebao, 2021 Under differential privacy, to solve the optimal publishing problem with multiple consistency constraints, an approximation method of multiple consistency constraints was proposed by the theoretical analysis of the principle of optimal consistency ...
Jianping CAI +4 more
doaj +2 more sources
Approximating shortest superstrings with constraints
Theoretical Computer Science, 1994 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Tao Jiang 0001, Ming Li 0001
openaire +1 more source
Linear Approximation of Execution-Time Constraints [PDF]
Formal Aspects of Computing, 2003 Abstract. This paper defines an algorithm for predicting worst-case and best-case execution times, and determining execution-time constraints of control-flow paths through real-time programs using their partial correctness semantics. The algorithm produces a linear approximation of path traversal conditions, worst-case and best-case execution
Karl Lermer +2 more
openaire +3 more sources