Results 61 to 70 of about 148,724 (314)

Complexity analysis of primal-dual algorithms for the semidefinite linear complementarity problem

Journal of Numerical Analysis and Approximation Theory, 2011
In this paper a primal-dual path-following interior-point algorithm for the monotone semidefinite linear complementarity problem is presented. The algorithm is based on Nesterov-Todd search directions and on a suitable proximity for tracing approximately the central-path.
Mohamed Achache, Naima Boudiaf
openaire   +3 more sources

Prevalence of Systemic Lupus Erythematosus in Australia, 2010–2022: A Population‐Based Study Using Linked National Administrative Health Data

Arthritis Care &Research, EarlyView.
Objective Systemic lupus erythematosus (SLE) is a heterogenous inflammatory condition with widely varying global prevalence estimates. The frequency of SLE in the general population of Australia has been reported to be notably lower than contemporary estimates in countries such as the United States or United Kingdom, at 19 to 39 per 100,000 as opposed ...
Lucinda Roper, Rachel Black, Joanna Tieu, Winnie Chen, Matthew Parker, Catherine Hill, Natasha Nassar, Mandana Nikpour   +7 more
wiley   +1 more source

Revisiting Online Algorithms: A Survey of Set Cover Solutions Beyond Competitive Analysis

IEEE Access
Online algorithms are crucial for real-time decision-making and adaptability across diverse fields, such as operations research, computer science, and combinatorics. These algorithms handle data incrementally and make decisions without prior knowledge of
Christine Markarian, Claude Fachkha, Noura Yassine   +2 more
doaj   +1 more source

A low-cost neural sorting network with O(1) time complexity [PDF]

, 2011
[[abstract]]In this paper, we present an O(1) time neural network with O(n1 + var epsilon) neurons and links to sort n data, var epsilon > 0. For large-size problems, it is desirable to have low-cost hardware solutions.
Lin, Shun-Shii;Hsu, Shen-Hsuan
core  

Statistical physics analysis of the computational complexity of solving random satisfiability problems using backtrack algorithms [PDF]

The European Physical Journal B, 2001
The computational complexity of solving random 3-Satisfiability (3-SAT) problems is investigated using statistical physics concepts and techniques related to phase transitions, growth processes and (real-space) renormalization flows. 3-SAT is a representative example of hard computational tasks; it consists in knowing whether a set of αN randomly drawn
S. Cocco, R. Monasson
openaire   +1 more source

High Health Care Utilization Preceding Diagnosis With Juvenile Idiopathic Arthritis

Arthritis Care &Research, EarlyView.
Objective Although early diagnosis improves long‐term outcomes, patients with juvenile idiopathic arthritis (JIA) often experience prolonged, circuitous paths to diagnosis. To inform diagnostic improvement, we sought to characterize health care utilization in the year preceding diagnosis. Methods We identified 10,021 patients with an incident diagnosis
Anna Costello, Rui Xiao, Xuemei Zhang, Jahan Jazayeri, Irit R. Rasooly, Pamela F. Weiss   +5 more
wiley   +1 more source

An Analysis of the Computational Complexity and Efficiency of Various Algorithms for Solving a Nonlinear Model of Radon Volumetric Activity with a Fractional Derivative of a Variable Order

Computation
The article presents a study of the computational complexity and efficiency of various parallel algorithms that implement the numerical solution of the equation in the hereditary α(t)-model of radon volumetric activity (RVA) in a storage chamber.
Dmitrii Tverdyi
doaj   +1 more source

A Comparison of Security and its Performance for Key Agreements in Post-Quantum Cryptography

IEEE Access, 2020
Nowadays, we are surrounded by devices collecting and transmitting private information. Currently, the two main mathematical problems that guarantee security on the Internet are the Integer Factorization Problem and the Discrete Logarithm Problem ...
Fabio Borges, Paulo Ricardo Reis, Diogo Pereira   +2 more
doaj   +1 more source

Path Coverage Algorithm Based on Minimization of Sensor Movement Distance [PDF]

Jisuanji gongcheng, 2018
Most of existing algorithms for path coverage do not consider minimization of sensors movement distance.Aiming at this situation,this paper proves that the above mentioned problem is NP-hard,and presents a heuristic path covering algorithm.It moves ...
CHEN Xi,LIU Zhixiong
doaj   +1 more source

An Effective Decomposition-Based Stochastic Algorithm for Solving the Permutation Flow-Shop Scheduling Problem

, 2021
This paper presents an effective stochastic algorithm that embeds a large neighborhood decomposition technique into a variable neighborhood search for solving the permutation flow-shop scheduling problem. The algorithm first constructs a permutation as a
Mehrdad Amirghasemi
core   +1 more source