Results 1 to 10 of about 15,838 (263)
Graph Neural Networks for Maximum Constraint Satisfaction [PDF]
Frontiers in Artificial Intelligence, 2021 Many combinatorial optimization problems can be phrased in the language of constraint satisfaction problems. We introduce a graph neural network architecture for solving such optimization problems.
Jan Tönshoff +3 more
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
Bio-ModelChecker: Using Bounded Constraint Satisfaction to Seamlessly Integrate Observed Behavior With Prior Knowledge of Biological Networks [PDF]
Frontiers in Bioengineering and Biotechnology, 2019 The in silico study and reverse engineering of regulatory networks has gained in recognition as an insightful tool for the qualitative study of biological mechanisms that underlie a broad range of complex illness.
Hooman Sedghamiz +6 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 ...
Khanna, Sanjeev +3 more
openaire +4 more sources
Synthesis of Valid Camera Poses for the Inspection of Triangular Facets in a 3D Mesh
Sensors, 2023 Automation of visual quality inspection tasks in manufacturing with machine vision is beginning to be the de facto standard for quality inspection as manufacturers realize that machines produce more reliable, consistent and repeatable analyses much ...
Edward Parrott +2 more
doaj +1 more source
Random Constraint Satisfaction Problems [PDF]
Electronic Proceedings in Theoretical Computer Science, 2009 Random instances of constraint satisfaction problems such as k-SAT provide challenging benchmarks. If there are m constraints over n variables there is typically a large range of densities r=m/n where solutions are known to exist with probability close ...
Amin Coja-Oghlan
doaj +1 more source
Graph Burning: Mathematical Formulations and Optimal Solutions
Mathematics, 2022 The graph burning problem is an NP-hard combinatorial optimization problem that helps quantify how vulnerable a graph is to contagion. This paper introduces three mathematical formulations of the problem: an integer linear program (ILP) and two ...
Jesús García-Díaz +3 more
doaj +1 more source
Decentralized Constraint Satisfaction [PDF]
IEEE/ACM Transactions on Networking, 2013 We show that several important resource allocation problems in wireless networks fit within the common framework of Constraint Satisfaction Problems (CSPs). Inspired by the requirements of these applications, where variables are located at distinct network devices that may not be able to communicate but may interfere, we define natural criteria that a ...
Ken R. Duffy +2 more
openaire +3 more sources
Steerable Music Generation which Satisfies Long-Range Dependency Constraints
Transactions of the International Society for Music Information Retrieval, 2022 Although music is full of repetitive motifs and themes, artificially intelligent temporal sequence models have yet to demonstrate the ability to model or generate musical compositions that satisfy steerable, long-range constraints needed to evoke such ...
Paul Bodily, Dan Ventura
doaj +1 more source
Logical compactness and constraint satisfaction problems [PDF]
Logical Methods in Computer Science, 2017 We investigate a correspondence between the complexity hierarchy of constraint satisfaction problems and a hierarchy of logical compactness hypotheses for finite relational structures.
Danny Rorabaugh +2 more
doaj +1 more source