Results 31 to 40 of about 1,354,069 (285)
Discrete optimization using Quantum Annealing on sparse Ising models
Frontiers in Physics, 2014 This paper discusses techniques for solving discrete optimization problems using quantumannealing. Practical issues likely to affect the computation include precision limitations, finitetemperature, bounded energy range, sparse connectivity, and small ...
Zhengbing eBian +5 more
doaj +1 more source
Applying quantum algorithms to constraint satisfaction problems [PDF]
Quantum, 2019 Quantum algorithms can deliver asymptotic speedups over their classical counterparts. However, there are few cases where a substantial quantum speedup has been worked out in detail for reasonably-sized problems, when compared with the best classical ...
Earl Campbell +2 more
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
Tropically Convex Constraint Satisfaction [PDF]
Theory of Computing Systems, 2017 A semilinear relation S is max-closed if it is preserved by taking the componentwise maximum. The constraint satisfaction problem for max-closed semilinear constraints is at least as hard as determining the winner in Mean Payoff Games, a notorious problem of open computational complexity.
Manuel Bodirsky, Marcello Mamino
openaire +2 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
The complexity of global cardinality constraints [PDF]
Logical Methods in Computer Science, 2010 In a constraint satisfaction problem (CSP) the goal is to find an assignment of a given set of variables subject to specified constraints. A global cardinality constraint is an additional requirement that prescribes how many variables must be assigned a ...
Andrei A. Bulatov, Daniel Marx
doaj +1 more source
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
Using Blocks for Constraint Satisfaction [PDF]
, 1998 The assembly problem is the spatial joining of separate rigid bodies within a CAD/CAM-system. The solution to the assembly does not only need to contain one consistent instantiation, but also qualitative information. In particular, this covers the localization of redundancy and remaining degrees of freedom in the mechanism.
Seybold, Bernhard +3 more
openaire +2 more sources
A finer reduction of constraint problems to digraphs [PDF]
Logical Methods in Computer Science, 2015 It is well known that the constraint satisfaction problem over a general relational structure A is polynomial time equivalent to the constraint problem over some associated digraph.
Jakub Bulín +3 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