Results 41 to 50 of about 2,351,118 (294)
Efficient handling of stability problems in shell optimization by asymmetric ‘worst-case’ shape imperfection [PDF]
, 2008 The paper presents an approach to shape optimization of proportionally loaded elastic shell structures under stability constraints. To reduce the stability-related problems, a special technique is utilized, by which the response analysis is always ...
Brank, Boštjan +3 more
core +1 more source
New techniques for cost sharing in combinatorial optimization games [PDF]
, 2010 Combinatorial optimization games form an important subclass of cooperative games. In recent years, increased attention has been given to the issue of finding good cost shares for such games.
Caprara, A, Letchford, A N
core +4 more sources
An Innovative Algorithm for Attacking Symmetric Ciphers Using D-Wave Quantum Annealing
Tsinghua Science and TechnologyQuantum computing is generally considered non-threatening to symmetric ciphers. Quantum attacks on symmetric ciphers require a thorough analysis of their internal structures, posing considerable difficulties and challenges.
Zhi Pei +3 more
doaj +1 more source
Energy and rf cavity phase symmetry enforcement in multiturn energy recovery linac models
Physical Review Accelerators and Beams, 2019 In a multipass energy recovery linac (ERL), each cavity must regain all energy expended from beam acceleration during beam deceleration, and the beam should achieve specific energy targets during each loop that returns it to the linac.
R. Koscica +4 more
doaj +1 more source
Optimal Angular Resolution for Face-Symmetric Drawings
Journal of Graph Algorithms and Applications, 2011 Let G be a graph that may be drawn in the plane in such a way that all internal faces are centrally symmetric convex polygons. We show how to find a drawing of this type that maximizes the angular resolution of the drawing, the minimum angle between any two incident edges, in polynomial time, by reducing the problem to one of finding parametric ...
David Eppstein, Kevin A. Wortman
openaire +5 more sources
On convergence of the maximum block improvement method [PDF]
, 2015 . The MBI (maximum block improvement) method is a greedy approach to solving optimization problems where the decision variables can be grouped into a finite number of blocks. Assuming that optimizing over one block of variables while fixing all others is
Shuzhong Zhang +5 more
core +1 more source
Symmetric Interdiction for Matching Problems [PDF]
, 2017 Motivated by denial-of-service network attacks, we introduce the symmetric interdiction model, where both the interdictor and the optimizer are subject to the same constraints of the underlying optimization problem.
Rajaraman, Rajmohan +5 more
core +1 more source
Advances in Mechanical Engineering, 2017 An improved particle swarm optimization method that has better equilibrium characteristic between global search and local search is proposed for parameter identification of hysteresis nonlinear dynamic model for piezoelectric positioning system.
Yu Xie, Jing-Li Fu, Ben-Yong Chen
doaj +1 more source
Positive Definiteness of Symmetric Rank 1 (H-Version) Update for Unconstrained Optimization
مجلة بغداد للعلوم, 2022 Several attempts have been made to modify the quasi-Newton condition in order to obtain rapid convergence with complete properties (symmetric and positive definite) of the inverse of Hessian matrix (second derivative of the objective function).
Saad Shakir Mahmood +2 more
doaj +1 more source