Results 61 to 70 of about 1,712 (186)

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

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

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

Embedding Equality Constraints of Optimization Problems into a Quantum Annealer

Algorithms, 2019
Quantum annealers such as D-Wave machines are designed to propose solutions for quadratic unconstrained binary optimization (QUBO) problems by mapping them onto the quantum processing unit, which tries to find a solution by measuring the parameters of a ...
Tomas Vyskocil, Hristo Djidjev
doaj   +1 more source

Quadratic Unconstrained Binary Optimization via Quantum-Inspired Annealing

Physical Review Applied, 2022
We present a classical algorithm to find approximate solutions to instances of quadratic unconstrained binary optimisation. The algorithm can be seen as an analogue of quantum annealing under the restriction of a product state space, where the dynamical evolution in quantum annealing is replaced with a gradient-descent based method. This formulation is
Bowles, Joseph, Dauphin, Alexandre, Huembeli, Patrick, Martinez, José, Acín, Antonio   +4 more
openaire   +2 more sources

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

GPS: A New TSP Formulation for Its Generalizations Type QUBO

Mathematics, 2022
We propose a new Quadratic Unconstrained Binary Optimization (QUBO) formulation of the Travelling Salesman Problem (TSP), with which we overcame the best formulation of the Vehicle Routing Problem (VRP) in terms of the minimum number of necessary ...
Saul Gonzalez-Bermejo, Guillermo Alonso-Linaje, Parfait Atchade-Adelomou   +2 more
doaj   +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

Generating hard quadratic unconstrained binary optimization instances via the method of combining bit reduction and duplication technique [PDF]

Quadratic Unconstrained Binary Optimization (QUBO) is a combinatorial optimization problem defined by an energy function that consists of a quadratic formula involving multiple binary variables.
Li, Xiaotian, Nakano, Koji, Itou, Yasuaki, Kato, Takumi, Kawamata, Yuya, Tsukiyama, Shunsuke   +5 more
core   +1 more source

Structure-inspired Ansatz and Warm Start of Variational Quantum Algorithms for Quadratic Unconstrained Binary Optimization Problems [PDF]

This paper introduces a structure-inspired ansatz for addressing quadratic unconstrained binary optimization problems with the Variational Quantum Eigensolver.
Kühn, Stefan, Jansen, Karl, Schwägerl, Tim, Stollenwerk, Tobias, Chai, Yahui   +4 more
core   +4 more sources