• Home
  • Search
  • Autonomous Search in Constraint Satisfaction via Black Hole: A Performance Evaluation Using Different Choice Functions
  • Cite Icon2
  • https://doi.org/10.1007/978-3-319-41000-5_6Copy DOI Icon

Autonomous Search in Constraint Satisfaction via Black Hole: A Performance Evaluation Using Different Choice Functions

  • Jan 1, 2016
  • Ricardo Soto +4 more
Show More
  • Abstract
  • Literature Map
  • References
  • Citations
  • Similar Papers
Abstract

Autonomous Search is a modern technique aimed at introducing self-adjusting features to problem-solvers. In the context of constraint satisfaction, the idea is to let the solver engine to autonomously replace its solving strategies by more promising ones when poor performances are identified. The replacement is controlled by a choice function, which takes decisions based on information collected during solving time. However, the design of choice functions can be done in very different ways, leading of course to very different resolution processes. In this paper, we present a performance evaluation of 16 rigorously designed choice functions. Our goal is to provide new and interesting knowledge about the behavior of such functions in autonomous search architectures. To this end, we employ a set of well-known benchmarks that share general features that may be present on most constraint satisfaction and optimization problems. We believe this information will be useful in order to design better autonomous search systems for constraint satisfaction.

Similar Papers
  • Conference Article

Evaluating the efficient of using choice functions to solve CSPs via Autonomous Search

  • Jun 01, 2016
  • Ricardo Soto +3
  • Research Article
  • Citations11

An Iterative local-search framework for solving constraint satisfaction problem

  • Jan 05, 2008
  • Applied Soft Computing Journal
  • Mohamed Tounsi +1
  • Research Article
  • Citations2

Weight-based Heuristics for Constraint Satisfaction and Combinatorial Optimization Problems

  • Feb 16, 2012
  • Journal of Mathematical Modelling and Algorithms
  • Marie-José Huguet +2
  • Book Chapter
  • Citations27

A Hyperheuristic Approach for Dynamic Enumeration Strategy Selection in Constraint Satisfaction

  • Jan 01, 2011
  • Broderick Crawford +3
  • Research Article
  • Citations15

An extensible autonomous search framework for constraint programming

  • Jan 01, 2011
  • International Journal of Physical Sciences
  • Broderick Crawford +5
  • Research Article
  • Citations150

Probe Backtrack Search for Minimal Perturbation in DynamicScheduling

  • Jan 01, 2000
  • Constraints
  • Hani El Sakkout +1
  • Conference Article
  • Citations6

Time Complexity of Constraint Satisfaction via Universal Algebra

  • Jan 01, 2020
  • Peter Jönsson +2
  • Research Article
  • Citations2

Solving constraint satisfaction and optimization problems by a neuro-fuzzy approach

  • Jan 01, 1999
  • IEEE Transactions on Systems, Man and Cybernetics, Part B (Cybernetics)
  • S Cavalieri +1
  • Research Article
  • Citations9

Global Constraints in Distributed Constraint Satisfaction and Optimization

  • Aug 30, 2013
  • The Computer Journal
  • C Bessiere +3
  • Research Article
  • Citations3

A learning Portfolio solver for optimizing the performance of constraint programming problems on multi‐core computing systems

  • Apr 27, 2016
  • Concurrency and Computation: Practice and Experience
  • Tarek Menouer +2
  • Conference Article
  • Citations1

Constraint Solving and Optimization Using Evolutionary Techniques

  • Aug 01, 2019
  • Mahdi Bidar +1
  • Conference Article
  • Citations1

Successive search method for valued constraint satisfaction and optimization problems

  • Nov 07, 2001
  • M Tounsi +1
  • Research Article
  • Citations37

Introduction to planning, scheduling and constraint satisfaction

  • Nov 06, 2008
  • Journal of Intelligent Manufacturing
  • Miguel A Salido
  • Conference Article
  • Citations3

Tractable Structures for Constraint Satisfaction with Truth Tables

  • Feb 10, 2009
  • DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)
  • Dániel Marx
  • Research Article
  • Citations21

Discovering Archipelagos of Tractability for Constraint Satisfaction and Counting

  • Mar 06, 2017
  • ACM Transactions on Algorithms
  • Robert Ganian +2
Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.