Results 271 to 280 of about 15,021 (304)

Deep Robust Moving Horizon Estimation for Nonlinear Multi-Rate Systems. [PDF]

Sensors (Basel)
Wang R, Wen S, Chen B.
europepmc   +1 more source

Local equations describe unreasonably efficient stochastic algorithms in random K-SAT. [PDF]

Proc Natl Acad Sci U S A
Machado D, González-García J, Mulet R.
europepmc   +1 more source

Enhancing hospital workforce planning, scheduling, and performance evaluation through an AI-driven human resource management system. [PDF]

Sci Rep
Wang Y, Zheng P, Guan Y, Zhang Q.
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Full Constraint Satisfaction Problems

SIAM Journal on Computing, 2006
Feder and Vardi have conjectured that all constraint satisfaction problems to a fixed structure (constraint language) are polynomial or NP-complete. This so-called dichotomy conjecture remains open, although it has been proved in a number of special cases.
Tomáš Feder, Pavol Hell
exaly   +2 more sources

Constraint satisfaction problems: Algorithms and applications

European Journal of Operational Research, 1999
A constraint satisfaction problem (CSP) requires a value, selected from a given finite domain, to be assigned to each variable in the problem, so that all constraints relating the variables are satisfied.
Sally Brailsford, Chris N Potts, Barbara M Smith   +2 more
exaly   +2 more sources

Belief Constraint Satisfaction Problems

2015 IEEE/ACS 12th International Conference of Computer Systems and Applications (AICCSA), 2015
Every problem that can be described by a set of variables and a set of constraints among those variables can easily be cast as a Constraint Satisfaction Problem (CSP). In spite of its simplicity, the standard CSP has proven unsuited for modeling ill-defined decision problems, especially, under uncertain circumstances.
Aouatef Rouahi, Kais Ben Salah, Khaled Ghédira   +2 more
openaire   +1 more source

Constraint satisfaction problems

ACM SIGLOG News, 2018
In this paper we briefly survey the history of the Dichotomy Conjecture for the Constraint Satisfaction problem, that was posed 25 years ago by Feder and Vardi. We outline some of the approaches to this conjecture, and then describe an algorithm that yields an answer to the conjecture.
openaire   +1 more source

An Algorithm for Constraint Satisfaction Problem

2017 IEEE 47th International Symposium on Multiple-Valued Logic (ISMVL), 2017
Many natural combinatorial problems can be expressed as constraint satisfaction problems. This class of problems is known to be NP-complete in general, but certain restrictions on theform of the constraints can ensure tractability. The standard way to parameterize interesting subclasses of the constraint satisfaction problem is via finite constraint ...
openaire   +1 more source