Results 91 to 100 of about 43,906 (221)

Constrained nonlinear optimal control: a converse HJB approach [PDF]

, 1996
Extending the concept of solving the Hamilton-Jacobi-Bellman (HJB) optimization equation backwards [2], the so called converse constrained optimal control problem is introduced, and used to create various classes of nonlinear systems for which the ...
Nevistić, Vesna, Primbs, James A.
core   +1 more source

Rydberg‐Atom Graphs for Quadratic Unconstrained Binary Optimization Problems

Advanced Quantum Technologies
Abstract There is a growing interest in harnessing the potential of the Rydberg‐atom system to address complex combinatorial optimization challenges. Here an experimental demonstration of how the quadratic unconstrained binary optimization (QUBO) problem can be effectively addressed using Rydberg‐atom graphs is presented.
Andrew Byun, Junwoo Jung, Kangheun Kim, Minhyuk Kim, Seokho Jeong, Heejeong Jeong, Jaewook Ahn   +6 more
openaire   +2 more sources

Differential item functioning detection across multiple groups

British Journal of Mathematical and Statistical Psychology, EarlyView.
Abstract Differential item functioning (DIF) can be investigated by estimating item response theory (IRT) parameters separately for different respondent groups, thus allowing for the detection of discrepancies in parameter estimates across groups. However, before comparing the estimates, it is necessary to convert them to a common metric due to the ...
Michela Battauz
wiley   +1 more source

Efficient digital quadratic unconstrained binary optimization solvers for SAT problems

New Journal of Physics
Boolean satisfiability (SAT) is a propositional logic problem of determining whether an assignment of variables satisfies a Boolean formula. Many combinatorial optimization problems can be formulated in Boolean SAT logic—either as k -SAT decision ...
Robert Simon Fong, Yanming Song, Alexander Yosifov   +2 more
doaj   +1 more source

Computing Skinning Weights via Convex Duality

Computer Graphics Forum, EarlyView.
We present an alternate optimization method to compute bounded biharmonic skinning weights. Our method relies on a dual formulation, which can be optimized with a nonnegative linear least squares setup. Abstract We study the problem of optimising for skinning weights through the lens of convex duality.
J. Solomon, O. Stein
wiley   +1 more source

Multi-Objective Portfolio Optimization Using a Quantum Annealer

Mathematics
In this study, the portfolio optimization problem is explored, using a combination of classical and quantum computing techniques. The portfolio optimization problem with specific objectives or constraints is often a quadratic optimization problem, due to
Esteban Aguilera, Jins de Jong, Frank Phillipson, Skander Taamallah, Mischa Vos   +4 more
doaj   +1 more source

Solving Standard and Generalized EMPM Eigenvalue Problems: A QUBO Approach for the D-Wave Quantum Annealer [PDF]

EPJ Web of Conferences
Within the Equation of Motion Phonon Method (EMPM) framework, we address the computation of the ground-state eigenpair of nuclear Hamiltonians by reformulating the eigenvalue problem as a Quadratic Unconstrained Binary Optimization (QUBO).
De Gregorio G., De Lucia C., Martone A., D’Aniello F.A., Mastroianni A., Nunziata G., Knapp F., Iudice N. Lo, Veselý P.   +8 more
doaj   +1 more source

Volume Quantization with Flexible Singularities for Hexahedral Meshing

Computer Graphics Forum, EarlyView.
Abstract We present a novel algorithm for quantization and subsequent hexahedral mesh generation from seamless volumetric maps. Quantization is the process of choosing integers that represent the numbers of hexahedral elements to be placed in each region of the volume, and transforming the seamless map into an integer‐grid map matching that choice ...
H. Brückler, M. Campen
wiley   +1 more source

Non‐Rigid 3D Shape Correspondences: From Foundations to Open Challenges and Opportunities

Computer Graphics Forum, EarlyView.
Abstract Estimating correspondences between deformed shape instances is a long‐standing problem in computer graphics; numerous applications, from texture transfer to statistical modelling, rely on recovering an accurate correspondence map. Many methods have thus been proposed to tackle this challenging problem from varying perspectives, depending on ...
A. Zhuravlev, L. Bastian, D. Cao, N. El Amrani, P. Roetzer, V. Ehm, R. Marin, H. Nishizawa, S. Morishima, C. Theobalt, N. Navab, D. Cremers, F. Bernard, Z. Lähner, V. Golyanik   +14 more
wiley   +1 more source

Establishing Shape Correspondences: A Survey

Computer Graphics Forum, EarlyView.
Abstract Shape correspondence between surfaces in 3D is a central problem in geometry processing, concerned with establishing meaningful relations between surfaces. While all correspondence problems share this goal, specific formulations can differ significantly: Downstream applications require certain properties that correspondences must satisfy ...
A. Heuschling, H. Meinhold, L. Kobbelt
wiley   +1 more source