Results 31 to 40 of about 15,838 (263)
A Characterisation of First-Order Constraint Satisfaction Problems [PDF]
Logical Methods in Computer Science, 2007 We describe simple algebraic and combinatorial characterisations of finite relational core structures admitting finitely many obstructions. As a consequence, we show that it is decidable to determine whether a constraint satisfaction problem is first ...
Benoit Larose +2 more
doaj +1 more source
Constraint Satisfaction with Counting Quantifiers [PDF]
SIAM Journal on Discrete Mathematics, 2012 We initiate the study of constraint satisfaction problems (CSPs) in the presence of counting quantifiers, which may be seen as variants of CSPs in the mould of quantified CSPs (QCSPs). We show that a single counting quantifier strictly between exists^1:=exists and exists^n:=forall (the domain being of size n) already affords the maximal possible ...
Barnaby Martin +2 more
openaire +4 more sources
Frontiers in Psychology, 2013 The 20 billion neurons of the neocortex have a mere hundred thousand motor neurons by which to express cortical contents in overt behavior. Implemented through a staggered cortical "efference cascade" originating in the descending axons of ...
Bjorn Hellmut Merker
doaj +1 more source
IEEE Access, 2023 Striking a balance between objective optimization and constraint satisfaction is essential for solving constrained multi-objective optimization problems (CMOPs).
Kaiwen Zhao, Peng Wang, Xiangrong Tong
doaj +1 more source
Practical Applications of a Set-Based Camera Deployment Methodology
Sensors, 2023 This work establishes a complete methodology for solving continuous sets of camera deployment solutions for automated machine vision inspection systems in industrial manufacturing facilities.
Edward Parrott +2 more
doaj +1 more source
Global Constraints in Distributed Constraint Satisfaction and Optimization [PDF]
The Computer Journal, 2013 Peer ...
Bessiere, Christian +3 more
openaire +3 more sources
IEEE Access, 2017 Arc consistency is the most popular filtering technique for solving constraint satisfaction problems. Constraint check plays a central role in establishing arc consistency.
Hongbo Li
doaj +1 more source
On Classifying Continuous Constraint Satisfaction Problems [PDF]
TheoretiCSA continuous constraint satisfaction problem (CCSP) is a constraint satisfaction problem (CSP) with an interval domain $U \subset \mathbb{R}$. We engage in a systematic study to classify CCSPs that are complete of the Existential Theory of the Reals, i.e.
Tillmann Miltzow, Reinier F. Schmiermann
doaj +1 more source
Gene Silencing Genetic Algorithm for 0/1 Knapsack with Object Preferences [PDF]
International Journal of Computational Intelligence Systems, 2011 Genetic Algorithms are efficient search and optimization techniques inspired by natural evolution. To show the difficulties in solving constrained optimization problems through GA, the 0/1 knapsack problem with user specific object preferences has been ...
S. Siva Sathya +2 more
doaj +1 more source
Compiling constraint satisfaction problems
Artificial Intelligence, 1999 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Weigel, R., Faltings, B.
openaire +3 more sources