Results 1 to 10 of about 9,288 (160)
On Classifying Continuous Constraint Satisfaction Problems [PDF]
TheoretiCS, 2022 A 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 +8 more sources
Solving constraint satisfaction problems with networks of spiking neurons [PDF]
Frontiers in Neuroscience, 2016 Network of neurons in the brain apply – unlike processors in our current generation ofcomputer hardware – an event-based processing strategy, where short pulses (spikes) areemitted sparsely by neurons to signal the occurrence of an event at a particular ...
Zeno eJonke +2 more
doaj +2 more sources
The Approximability of Constraint Satisfaction Problems [PDF]
SIAM Journal on Computing, 2001 Summary: We study optimization problems that may be expressed as ``Boolean constraint satisfaction problems.'' An instance of a Boolean constraint satisfaction problem is given by m constraints applied to n Boolean variables. Different computational problems arise from constraint satisfaction problems depending on the nature of the ``underlying ...
Sanjeev Khanna +2 more
exaly +3 more sources
An Ant Colony Optimization Based on Information Entropy for Constraint Satisfaction Problems [PDF]
Entropy, 2019 Solving the constraint satisfaction problem (CSP) is to find an assignment of values to variables that satisfies a set of constraints. Ant colony optimization (ACO) is an efficient algorithm for solving CSPs.
Boxin Guan, Yuhai Zhao, Yuan Li
doaj +2 more sources
Using Stochastic Spiking Neural Networks on SpiNNaker to Solve Constraint Satisfaction Problems [PDF]
Frontiers in Neuroscience, 2017 Constraint satisfaction problems (CSP) are at the core of numerous scientific and technological applications. However, CSPs belong to the NP-complete complexity class, for which the existence (or not) of efficient algorithms remains a major unsolved ...
Gabriel A. Fonseca Guerra +1 more
doaj +2 more sources
Asymmetric continuous-time neural networks without local traps for solving constraint satisfaction problems. [PDF]
PLoS ONE, 2013 There has been a long history of using neural networks for combinatorial optimization and constraint satisfaction problems. Symmetric Hopfield networks and similar approaches use steepest descent dynamics, and they always converge to the closest local ...
Botond Molnár, Mária Ercsey-Ravasz
doaj +2 more sources
Models for Random Constraint Satisfaction Problems [PDF]
SIAM Journal on Computing, 2003 Summary: We introduce a class of models for random constraint satisfaction problems. This class includes and generalizes many previously studied models. We characterize those models from our class which are asymptotically interesting in the sense that the limiting probability of satisfiability changes significantly as the number of constraints ...
Michael Molloy
exaly +2 more sources
Universal Algebraic Methods for Constraint Satisfaction Problems [PDF]
Logical Methods in Computer Science, 2022 After substantial progress over the last 15 years, the "algebraic CSP-dichotomy conjecture" reduces to the following: every local constraint satisfaction problem (CSP) associated with a finite idempotent algebra is tractable if and only if the algebra ...
Clifford Bergman, William DeMeo
doaj +1 more source
Distance constraint satisfaction problems [PDF]
Information and Computation, 2016 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 +3 more sources
New schemes for simplifying binary constraint satisfaction problems [PDF]
Discrete Mathematics & Theoretical Computer Science, 2020 Finding a solution to a Constraint Satisfaction Problem (CSP) is known to be an NP-hard task. This has motivatedthe multitude of works that have been devoted to developing techniques that simplify CSP instances before or duringtheir resolution.The ...
Wady Naanaa
doaj +1 more source