Results 61 to 70 of about 151,821 (357)
A Routing Algorithm Solving the Container Problem in a Hypercube with Bit Constraint [PDF]
As reflected by the TOP500 list, hypercubes are popular interconnection networks for massively parallel systems, the main reason being the simplicity and ease of implementation of this network topology.
Antoine Bossard, Keiichi Kaneko
doaj +1 more source
Filtering algorithms for the multiset ordering constraint
Constraint programming (CP) has been used with great success to tackle a wide variety of constraint satisfaction problems which are computationally intractable in general. Global constraints are one of the important factors behind the success of CP. In this paper, we study a new global constraint, the multiset ordering constraint, which is shown to be ...
Alan M. Frisch +4 more
openaire +3 more sources
Objective We developed a novel electronic health record sidecar application to visualize key rheumatoid arthritis (RA) outcomes, including disease activity, physical function, and pain, via a patient‐facing graphical interface designed for use during outpatient visits (“RA PRO dashboard”).
Gabriela Schmajuk +16 more
wiley +1 more source
Systemic sclerosis (SSc) is a rare autoimmune disease defined by immune dysregulation, vasculopathy, and progressive fibrosis of the skin and internal organs. Despite advances in care, major complications such as interstitial lung disease (ILD) and myocardial involvement remain the leading causes of morbidity and mortality.
Cristiana Sieiro Santos +2 more
wiley +1 more source
Phase transition behaviour in constraint satisfaction problems [PDF]
Many problems in artificial intelligence and computer science can be formulated as constraint satisfaction problems (CSPs). A CSP consists of a set of variables among which a set of constraints are imposed, with a solution corresponding to an assignment ...
Stuart Alexander Grant +1 more
core
An Optimal Filtering Algorithm for Table Constraints [PDF]
Filtering algorithms for table constraints are constraint-based, which means that the propagation queue only contains information on the constraints that must be reconsidered. This paper proposes four efficient value-based algorithms for table constraints, meaning that the propagation queue also contains information on the removed values.
Mairy, Jean-Baptiste +3 more
openaire +2 more sources
What Do Large Language Models Know About Materials?
If large language models (LLMs) are to be used inside the material discovery and engineering process, they must be benchmarked for the accurateness of intrinsic material knowledge. The current work introduces 1) a reasoning process through the processing–structure–property–performance chain and 2) a tool for benchmarking knowledge of LLMs concerning ...
Adrian Ehrenhofer +2 more
wiley +1 more source
A novel strategy for pairwise test suite generation
A new pairwise hybrid artificial bee colony(PHABC)strategy based on artificial bee colony(ABC)algorithm and particle swarm optimization(PSO) algorithm was proposed in this paper.
DING Huaibao
doaj +1 more source
A Workflow to Accelerate Microstructure‐Sensitive Fatigue Life Predictions
This study introduces a workflow to accelerate predictions of microstructure‐sensitive fatigue life. Results from frameworks with varying levels of simplification are benchmarked against published reference results. The analysis reveals a trade‐off between accuracy and model complexity, offering researchers a practical guide for selecting the optimal ...
Luca Loiodice +2 more
wiley +1 more source
An online convex optimization algorithm for controlling linear systems with state and input constraints [PDF]
Marko Nonhoff, Matthias A. Müller
openalex +1 more source

