Results 101 to 110 of about 111,305 (313)

Computer Vision Technologies in Movement Disorders: A Systematic Review

open access: yesMovement Disorders Clinical Practice, EarlyView.
Abstract Background Evaluation of movement disorders primarily relies on phenomenology. Despite refinements in diagnostic criteria, the accuracy remains suboptimal. Such a gap may be bridged by machine learning and video technology, which permit objective, quantitative, non‐invasive motor analysis.
Pasquale Maria Pecoraro   +4 more
wiley   +1 more source

Parallel projected variable metric algorithms for unconstrained optimization [PDF]

open access: yes
The parallel variable metric optimization algorithms of Straeter (1973) and van Laarhoven (1985) are reviewed, and the possible drawbacks of the algorithms are noted.
Freeman, T. L.
core   +1 more source

A dimension-reducing method for unconstrained optimization

open access: yesJournal of Computational and Applied Mathematics, 1996
AbstractA new method for unconstrained optimization in Rn is presented. This method reduces the dimension of the problem in such a way that it can lead to an iterative approximate formula for the computation of (n − 1) components of the optimum while its remaining component is computed separately using the final approximations of the other components ...
T. N. Grapsa, Michael N. Vrahatis
openaire   +2 more sources

Capture of Longitudinal Change in Real‐Life Walking in Cerebellar Ataxia Increases Patient Relevance and Effect Size

open access: yesMovement Disorders, EarlyView.
ABSTRACT Background With disease‐modifying drugs for degenerative ataxias on the horizon, ecologically valid measures of gait performance that can detect patient‐relevant changes in trial‐like time frames are highly warranted. Objectives In this 2‐year longitudinal study, we aimed to unravel ataxic gait measures sensitive to longitudinal changes in ...
Jens Seemann   +8 more
wiley   +1 more source

Multi-Objective Optimization Technique Based on QUBO and an Ising Machine

open access: yesIEEE Access
With an increase in the complexity of society, solving multi-objective optimization problems (MOPs) has become crucial. In this study, we introduced a novel method called “quadratic unconstrained binary optimization based on the weighted normal ...
Hiroshi Ikeda, Takashi Yamazaki
doaj   +1 more source

Один подход к решению нелинейных задач оптимизации с ограничениями

open access: yes, 2009
Розглянуто підхід до зведення задачі опуклого програмування з обмеженнями до задачі безумовної оптимізації. Вважається заданою початкова точка, що належить внутрішності допустимої множини. Еквівалентна задача безумовної оптимізації формується таким чином,
Лаптин, Ю.П.
core  

Solving Large‐Scale Weapon Target Assignment Problems in Seconds Using Branch‐Price‐And‐Cut

open access: yesNaval Research Logistics (NRL), EarlyView.
ABSTRACT This paper proposes a framework based on branch‐price‐and‐cut to solve the weapon target assignment (WTA) problem, a popular class of non‐linear assignment problems that has received significant attention over the past several decades. We first reformulate the WTA into a form amenable to column generation and then derive efficient algorithms ...
Dimitris Bertsimas, Alex Paskov
wiley   +1 more source

Home - About - Disclaimer - Privacy