Results 41 to 50 of about 15,838 (263)
Distance constraint satisfaction problems
We study the complexity of constraint satisfaction problems for templates $Γ$ that are first-order definable in $(\Bbb Z; succ)$, the integers with the successor relation. Assuming a widely believed conjecture from finite domain constraint satisfaction (we require the tractability conjecture by Bulatov, Jeavons and Krokhin in the special case of ...
Manuel Bodirsky +4 more
openaire +2 more sources
Optimal scheduling of power systems considering demand response
A novel optimal scheduling method considering demand response is proposed for power systems incorporating with large scale wind power. The proposed method can jointly dispatch the energy resources and demand side resources to mitigate the fluctuation of ...
Zhaohong Bie +3 more
doaj +1 more source
Using Blocks for Constraint Satisfaction [PDF]
The assembly problem is the spatial joining of separate rigid bodies within a CAD/CAM-system. The solution to the assembly does not only need to contain one consistent instantiation, but also qualitative information. In particular, this covers the localization of redundancy and remaining degrees of freedom in the mechanism.
Seybold, Bernhard +3 more
openaire +2 more sources
Evolutionary analysis across 32 placental mammals identified positive selection at residues H148 and W149 in the immune receptor FcγR1. Ancestral reconstruction combined with molecular dynamics simulations reveals how these mutations may influence receptor structure and dynamics, providing insight into the evolution of antibody recognition and immune ...
David A. Young +7 more
wiley +1 more source
Directed evolution of enzymes at the crossroads of tradition and innovation
An iterative cycle of data‐driven enzyme optimization comprising four stages: genetic diversification of a template enzyme, expression of protein variants, high‐throughput evaluation, and machine‐learning‐guided redesign of the next variant library.
Maria Tomkova +2 more
wiley +1 more source
A finer reduction of constraint problems to digraphs [PDF]
It is well known that the constraint satisfaction problem over a general relational structure A is polynomial time equivalent to the constraint problem over some associated digraph.
Jakub Bulín +3 more
doaj +1 more source
ABSTRACT Objective Neurochemical levels measured by brain MR spectroscopy (MRS) have been proposed as endpoints for clinical trials in early‐stage spinocerebellar ataxia (SCA) trials. We tested their trial‐readiness by quantifying neurochemicals in three affected brain regions in early‐stage cohorts of SCA2 and SCA3, examining their reproducibility in ...
James M. Joers +19 more
wiley +1 more source
Objective To support high‐quality, patient‐centered care for systemic lupus erythematosus (SLE), the American College of Rheumatology (ACR) developed evidence‐based measures incorporating clinical and patient‐reported outcome measures (PROMs). Using the Consolidated Framework for Implementation Research (CFIR), we conducted semistructured interviews ...
Catherine Nasrallah +13 more
wiley +1 more source
Objective To evaluate utility of an artificial intelligence (AI) health coach for systemic sclerosis (SSc) self‐management and identify patterns associated with participant engagement. Methods We conducted a mixed methods study in which an AI health coach, powered by a large language model (LLM), was used to support self‐management for SSc.
Nirali Shah +4 more
wiley +1 more source
Constraint models for complex state transitions
Constraint-based scheduling is an approach for solving real-life scheduling problems by combining the generality of AI techniques with the efficiency of OR techniques. Basically, it describes a scheduling problem as a constraint satisfaction problem and
Roman Bartak
doaj

