Results 241 to 250 of about 1,354,069 (285)

Trajectory Planning of Spraying Robot Based on Multi Strategy Improved Beluga Optimization Algorithm. [PDF]

Sensors (Basel)
Wen Y, Wang R, Huang T.
europepmc   +1 more source

Time affluence and health: a scoping review of conceptual and methodological patterns. [PDF]

Front Public Health
Yoon SY.
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Compaction, Retraction, and Constraint Satisfaction

SIAM Journal on Computing, 2004
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Narayan Vikas
exaly   +3 more sources

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.
François Pachet
exaly   +2 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   +2 more sources

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

The logic of constraint satisfaction

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

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   +2 more sources

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   +2 more sources

Tools for constraint satisfaction

Proceedings of 1993 IEEE Conference on Tools with Al (TAI-93), 2002
Constraint satisfaction problems involve finding values for problem variables that satisfy constraints on what combinations of values are permitted. They have applications in many areas of artifical intelligence, from planning to natural language understanding. Constraint satisfaction can be very difficult.
openaire   +2 more sources