Iterative quantum algorithm for combinatorial optimization based on quantum gradient descent
Combinatorial optimization has wide and high-value applications in many fields of science and industry, but solving general combinatorial optimization problems is non-deterministic polynomial time (NP) hard.
Xin Yi +5 more
doaj +1 more source
Combinatorial grid sequencing: An axiomatic framework for grid-based combinatorial dynamics
This work introduces Combinatorial Grid Sequencing (CGS), an axiomatic combinatorial theory inspired by certain patterns of concrete-casting works in multi-storey building construction.
Christoporus A. A. Ohmar +2 more
core +1 more source
Objective The aim of this study was to test the hypothesis that multijoint osteoarthritis would modify the relation between time and frailty progression, in which more affected joints would lead to larger declines over six years compared to those without osteoarthritis using data from the Canadian Longitudinal Study on Aging.
Carson Halliwell +2 more
wiley +1 more source
Automated Hand Flexor Tendon–Thickness Measurement in Systemic Sclerosis
Objective Systemic sclerosis (SSc) can affect flexor tendons, contributing to hand function problems and reduced quality of life. Tendon changes are currently assessed with ultrasonography and measured manually, a time‐consuming process prone to interobserver variability.
Mark Greveling +4 more
wiley +1 more source
Reasoning on transition from manipulative strategies to general procedures in solving counting problems [PDF]
We describe the procedures used by 11- to 12-year-old students for solving basic counting problems in order to analyse the transition from manipulative strategies involving direct counting to the use of the multiplication principle as a general procedure
Figueiras, Lourdes, Cañadas, María C.
core
A Q‐Learning Algorithm to Solve the Two‐Player Zero‐Sum Game Problem for Nonlinear Systems
A Q‐learning algorithm to solve the two‐player zero‐sum game problem for nonlinear systems. ABSTRACT This paper deals with the two‐player zero‐sum game problem, which is a bounded L2$$ {L}_2 $$‐gain robust control problem. Finding an analytical solution to the complex Hamilton‐Jacobi‐Issacs (HJI) equation is a challenging task.
Afreen Islam +2 more
wiley +1 more source
The Agents-are-Substitutes Property in Continuous Generalized Assignment Problems [PDF]
The VCG mechanism has some nice properties if the agents-are-substitutes property holds.For example, for combinatorial auctions the property assures that the VCG mechanism is supported by a pricing equilibrium. The existence of such a pricing equilibrium
Vermeulen,Dries +2 more
core
Observer‐Based Adaptive Event‐Triggered Tracking Control for Fuzzy TS Systems With Premise Mismatch
This paper presents an adaptive logistic event‐triggered observer‐based tracking controller for Takagi‐Sugeno fuzzy systems under constrained inputs and network delays. Leveraging a hybrid LMI and Secretary Bird Optimization approach, this strategy significantly minimizes communication overhead and computational burden while ensuring optimal reference ...
Oussama Djadane +3 more
wiley +1 more source
Ferroelectric compute-in-memory annealer for combinatorial optimization problems
Computationally hard combinatorial optimization problems (COPs) are ubiquitous in many applications. Various digital annealers, dynamical Ising machines, and quantum/photonic systems have been developed for solving COPs, but they still suffer from the ...
Xunzhao Yin +13 more
doaj +1 more source
An Agent Based Market Design Methodology for Combinatorial Auctions [PDF]
Auction mechanisms have attracted a great deal of interest and have been used in diverse e-marketplaces. In particular, combinatorial auctions have the potential to play an important role in electronic transactions.
Kun Chang Lee, Gyoo Gun Lim, Jinho Choi
core

