Results 221 to 230 of about 15,838 (263)

An equity aware recommender system for university admissions balancing operational constraints and strategic objectives. [PDF]

Sci Rep
Ibrahim A, Alarood A, Alsolami E.
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

The framework approach for constraint satisfaction

ACM Computing Surveys, 2000
Constraint satisfaction programming (CSP) is a powerful paradigm for solving complex combinatorial problems, which has gained a lot of attention recently. Putting the power of constraint satisfaction into the hands of programmers and designers in a simple fashion is, however, still an open issue.
Pierre Roy, Anne Liret, François Pachet
openaire   +3 more sources

Partial constraint satisfaction

Artificial Intelligence, 1992
Abstract A constraint satisfaction problem involves finding values for variables subject to constraints on which combinations of values are allowed. In some cases it may be impossible or impractical to solve these problems completely. We may seek to partially solve the problem, in particular by satisfying a maximal number of constraints.
Eugene C. Freuder, Richard J. Wallace
openaire   +1 more source

Boosting Distributed Constraint Satisfaction

Journal of Heuristics, 2005
Competition and cooperation can boost the performance of search. Both can be implemented with a portfolio of algorithms which run in parallel, give hints to each other and compete for being the first to finish and deliver the solution. In this paper we present a new generic framework for the application of algorithms for distributed constraint ...
Youssef Hamadi, Georg Ringwelski
openaire   +1 more source

A Glimpse of Constraint Satisfaction

Artificial Intelligence Review, 1999
Constraint satisfaction has become an important field in computer science. This technology is embedded in millions of pounds of software used by major companies. Many researchers or software engineers in the industry could have benefited from using constraint technology without realizing it.
openaire   +1 more source

The logic of constraint satisfaction

Artificial Intelligence, 1992
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +2 more sources

Unordered Constraint Satisfaction Games

2012
We consider two-player constraint satisfaction games on systems of Boolean constraints, in which the players take turns in selecting one of the available variables and setting it to true or false, with the goal of maximising (for Player I) or minimising (for Player II) the number of satisfied constraints. Unlike in standard QBF-type variable assignment
Orponen Pekka, Ahlroth Lauri
openaire   +1 more source

Resolution and Constraint Satisfaction

2003
We study two resolution-like refutation systems for finite-domain constraint satisfaction problems, and the efficiency of these and of common CSP algorithms. By comparing the relative strength of these systems, we show that for instances with domain size d, backtracking with 2-way branching is super-polynomially more powerful than backtracking with d ...
openaire   +1 more source