Results 21 to 30 of about 791,635 (286)
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
Connected bin packing problem on traceable graphs [PDF]
Iranian Journal of Numerical Analysis and Optimization, 2022 We consider a new extension of the bin packing problem in which a set of connectivity constraints should be satisfied. An undirected graph with a weight function on the nodes is given.
A. Nejoomi, A. Dolati
doaj +1 more source
Reducing Revenue to Welfare Maximization: Approximation Algorithms and other Generalizations [PDF]
, 2013 It was recently shown in [http://arxiv.org/abs/1207.5518] that revenue optimization can be computationally efficiently reduced to welfare optimization in all multi-dimensional Bayesian auction problems with arbitrary (possibly combinatorial) feasibility ...
Cai, Yang +2 more
core +5 more sources
Applied Sciences, 2021 Structural optimization aims to achieve a structural design that provides the best performance while satisfying the given design constraints. When uncertainties in design and conditions are taken into account, reliability-based design optimization (RBDO)
Junho Chun
doaj +1 more source
Constrained spectral clustering via multi–layer graph embeddings on a grassmann manifold
International Journal of Applied Mathematics and Computer Science, 2019 We present two algorithms in which constrained spectral clustering is implemented as unconstrained spectral clustering on a multi-layer graph where constraints are represented as graph layers.
Trokicić Aleksandar +1 more
doaj +1 more source
Constrained Monotone Function Maximization and the Supermodular Degree [PDF]
, 2014 The problem of maximizing a constrained monotone set function has many practical applications and generalizes many combinatorial problems. Unfortunately, it is generally not possible to maximize a monotone set function up to an acceptable approximation ...
Feldman, Moran, Izsak, Rani
core +3 more sources
Application of response surface methodology to stiffened panel optimization [PDF]
, 2006 In a multilevel optimization frame, the use of surrogate models to approximate optimization constraints allows great time saving. Among available metamodelling techniques we chose to use Neural Networks to perform regression of static mechanical criteria,
Grihon, Stéphane +2 more
core +1 more source
The Green function variational approximation: Significance of physical constraints [PDF]
, 2016 We present a calculation of the spectral properties of a single charge doped at a Cu($3d$) site of the Cu-F plane in KCuF$_{3}$. The problem is treated by generating the equations of motion for the Green's function by means of subsequent Dyson expansions
Berciu, Mona +2 more
core +2 more sources
Warm inflation dynamics in the low temperature regime [PDF]
, 2006 Warm inflation scenarios are studied with the dissipative coefficient computed in the equilibrium approximation. Use is made of the analytical expressions available in the low temperature regime with focus on the possibility of achieving strong ...
Arjun Berera, Mar Bastero-Gil
core +2 more sources
Approximate Deadline-Scheduling with Precedence Constraints [PDF]
, 2015 We consider the classic problem of scheduling a set of n jobs non-preemptively on a single machine. Each job j has non-negative processing time, weight, and deadline, and a feasible schedule needs to be consistent with chain-like precedence constraints. The goal is to compute a feasible schedule that minimizes the sum of penalties of late jobs. Lenstra
Efsandiari, Hossein +5 more
openaire +2 more sources