Search
Search Results
-
The Complexity of the Distributed Constraint Satisfaction Problem
We study the complexity of the Distributed Constraint Satisfaction Problem (DCSP) on a synchronous, anonymous network from a theoretical standpoint....
-
Algebraic Global Gadgetry for Surjective Constraint Satisfaction
The constraint satisfaction problem (CSP) on a finite relational structure B is to decide, given a set of constraints on variables where the...
-
First-order logic as a constraint satisfaction problem
In this paper, we discourse an analysis of classical first-order predicate logic as a constraint satisfaction problem, CSP. First, we will offer our...
-
HSJ-Solver: a new method based on GHD for answering conjunctive queries and solving constraint satisfaction problems
Evaluating conjunctive queries (CQs) is NP-hard in general; however, acyclic CQs or nearest acyclic CQs can be evaluated in polynomial time. Many...
-
Discrete-Choice Multi-agent Optimization: Decentralized Hard Constraint Satisfaction for Smart Cities
Making Smart Cities more sustainable, resilient and democratic is emerging as an endeavor of satisfying hard constraints, for instance meeting...
-
Explaining the Effects of Preprocessing on Constraint Satisfaction Search
Preprocessing constraint satisfaction problems is a much studied method for improving the performance of subsequent solution search. The traditional...
-
Optimization of parallel test task scheduling with constraint satisfaction
Parallel test task scheduling is an efficient way to shorten the final makespan of several huge test projects. Put simply, a set of test tasks should...
-
A graph-based big data optimization approach using hidden Markov model and constraint satisfaction problem
To address the challenges of big data analytics, several works have focused on big data optimization using metaheuristics. The constraint...
-
Fast and parallel decomposition of constraint satisfaction problems
Constraint Satisfaction Problems (CSP) are notoriously hard. Consequently, powerful decomposition methods have been developed to overcome this...
-
Spacetime programming: a synchronous language for constraint search
Constraint programming is a paradigm for computing with mathematical relations named constraints. It is a declarative approach to describe many...
-
A collection of Constraint Programming models for the three-dimensional stable matching problem with cyclic preferences
We introduce five constraint models for the 3-dimensional stable matching problem with cyclic preferences and study their relative performances under...
-
Combining Genetic Algorithms and Temporal Constraint Satisfaction for Recommending Personalized Tourist Itineraries
In this paper we propose an approach that combines genetic algorithms and temporal constraint satisfaction for generating personalized tourist...
-
Map** Signaling Mechanisms in Neurotoxic Injury from Sparsely Sampled Data Using a Constraint Satisfaction Framework
Gulf War Illness (GWI) is a poorly understood exposure-induced neuroinflammatory disorder where complexity and the high cost of animal exposure...
-
A bounded constraint-based approach to aid in fault localization from a counterexample
A model checker can produce a trace of counter-example for an erroneous program, which is often difficult to exploit for locating faults. In this...
-
A Constraint-Based Greedy-Local-Global Search for the Warehouse Location Problem
Constraint optimization problems offer a means to obtain a global solution for a given problem. At the same time the promise of finding a global...
-
Checking Constraint Satisfaction
We address the problem of verifying a constraint by a set of solutions S. This problem is present in almost all systems aiming at learning or...
-
CSP beyond tractable constraint languages
The constraint satisfaction problem (CSP) is among the most studied computational problems. While NP-hard, many tractable subproblems have been...
-
MFS-SubSC: an efficient algorithm for mining frequent sequences with sub-sequence constraint
Mining frequent sequences (FS) with constraints in a sequence database (SDB) are a critical task in Data Mining, as it forms the basis for...
-
Solving the Car Sequencing Problem with Cross-Ratio Constraints Using Constraint Programming Approach
The rise of mass-individualization has underscored the significance of Mixed-Model Assembly Lines (MMALs) for producing diverse products on the same...
-
CoPTIC: Constraint Programming Translated Into C
Constraint programming systems allow a diverse range of problems to be modelled and solved. Most systems require the user to learn a new constraint...