Search
Search Results
-
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...
-
Toward fast belief propagation for distributed constraint optimization problems via heuristic search
Belief propagation (BP) approaches, such as Max-sum and its variants, are important methods to solve large-scale Distributed Constraint Optimization...
-
A dual-population search differential evolution algorithm for functional distributed constraint optimization problems
Functional Distributed Constraint Optimization Problems (F-DCOPs) is a constraint processing framework for continuous variables in multi-agent system...
-
ViolationLS: Constraint-Based Local Search in CP-SAT
We introduce ViolationLS, a Constraint-Based Local Search (CBLS) solver for arbitrary MiniZinc models based on the Feasibility Jump Mixed-Integer...
-
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...
-
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...
-
A Constraint-Based Mathematical Modeling Library in Prolog with Answer Constraint Semantics
Constraint logic programming emerged in the late 80’s as a highly declarative class of programming languages based on first-order logic and theories...
-
Chaotic Quasi-Oppositional Differential Search Algorithm for Transient Stability Constraint Optimal Power Flow Problem
In this research work, the concept of Chaotic Quasi-Oppositional Differential Search Algorithm (CQODSA) has been successfully applied to address the...
-
Distributional constraint discovery for intelligent auditing
Constraint discovery in relational databases aims to find constraints that express dependency relationships among a set of attributes and has...
-
Bi-objective evolutionary Bayesian network structure learning via skeleton constraint
Bayesian network is a popular approach to uncertainty knowledge representation and reasoning. Structure learning is the first step to learn a...
-
VNAS: Variational Neural Architecture Search
Differentiable neural architecture search delivers point estimation to the optimal architecture, which yields arbitrarily high confidence to the...
-
Constraint Propagation on GPU: A Case Study for the Cumulative Constraint
The Cumulative constraint is one of the most important global constraints, as it naturally arises in a variety of problems related to scheduling with...
-
Constraint-free discretized manifold-based path planner
Autonomous robotic path planning in partially known environments, such as warehouse robotics, deals with static and dynamic constraints. Static...
-
Constraint Programming Paradigm
InParadigmconstraint Programmingconstraint this chapter we describe the constraint programming paradigm, a third approach to declarative programming...
-
Multi-constraint shortest path using forest hop labeling
The Multi-Constraint Shortest Path (MCSP) problem aims to find the shortest path between two nodes in a network subject to a given constraint set. It...
-
Online learning of variable ordering heuristics for constraint optimisation problems
Solvers for constraint optimisation problems exploit variable and value ordering heuristics. Numerous expert-designed heuristics exist, while recent...
-
Improving greedy local search methods by switching the search space
Bayesian networks play a vital role in human understanding of the world. Finding a precise equivalence class of a Bayesian network is an effective...
-
Proof Logging for the Circuit Constraint
Proof logging in constraint programming is an approach to certifying a conclusion reached by a solver. To allow for this, different propagators must...
-
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....
-
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...
