• Home
  • Search
  • Evaluating the efficient of using choice functions to solve CSPs via Autonomous Search
  • https://doi.org/10.1109/cisti.2016.7521571Copy DOI Icon

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

  • Jun 1, 2016
  • Ricardo Soto +3 more
Show More
  • Abstract
  • Literature Map
  • References
  • Similar Papers
Abstract

Constraint programming is a powerful paradigm that allows for solving optimization and constraint satisfaction problems (CSPs). In this context, a main concern of this technology is that the efficient problem resolution usually relies on the employed solving strategy. Unfortunately, selecting the proper one is known to be complex as the behavior of strategies is commonly unpredictable. Recently, Autonomous Search appeared as a new technique to tackle this concern. The idea is to let the solver adapt its strategy during solving time in order to improve performance. This task is controlled by a choice function which decides, based on performance information, how the strategy must be updated. In this paper, we evaluate the impact on the solving phase of 16 different choice functions. We employ as test bed a set of well-known benchmarks that collect general features present on most CSPs. Interesting experimental results are obtained in order to provide the best-performing choice functions for solving CSPs.

Similar Papers
  • Book Chapter
  • Citations2

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

  • Jan 01, 2016
  • Ricardo Soto +4
  • Research Article
  • Citations15

An extensible autonomous search framework for constraint programming

  • Jan 01, 2011
  • International Journal of Physical Sciences
  • Broderick Crawford +5
  • Conference Article
  • Citations6

Time Complexity of Constraint Satisfaction via Universal Algebra

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

Discovering Archipelagos of Tractability for Constraint Satisfaction and Counting

  • Mar 06, 2017
  • ACM Transactions on Algorithms
  • Robert Ganian +2
  • Research Article
  • Citations11

An Iterative local-search framework for solving constraint satisfaction problem

  • Jan 05, 2008
  • Applied Soft Computing Journal
  • Mohamed Tounsi +1
  • Book Chapter
  • Citations13

A Cascadable VLSI Design for GENET

  • Jan 01, 1994
  • Chang J. Wang +1
  • Single Book
  • Citations1457

Handbook of Constraint Programming

  • Jan 01, 2006
  • Francesca Rossi +2
  • Conference Article
  • Citations9

Coevolutionary genetic algorithm for constraint satisfaction with a genetic repair operator for effective schemata formation

  • Oct 12, 1999
  • H Handa +4
  • Book Chapter
  • Citations11

The Design of Cryptographic S-Boxes Using CSPs

  • Jan 01, 2011
  • Venkatesh Ramamoorthy +4
  • PDF
  • Research Article
  • Citations5

Robust Algorithms with Polynomial Loss for Near-Unanimity CSPs

  • Jan 01, 2019
  • SIAM Journal on Computing
  • Víctor Dalmau +5
  • Conference Article
  • Citations6

Coupling Visual Semantics and High-Level Relational Characterization within a Transparent and Penetrable Image Retrieval Framework

  • Oct 01, 2007
  • Mohammed Belkhatir
  • Book Chapter
  • Citations252

SAT v CSP

  • Jan 01, 2000
  • Toby Walsh
  • Conference Article
  • Citations4

Discrete Particle Swarm Optimization Algorithm for Dynamic Constraint Satisfaction with Minimal Perturbation

  • Oct 01, 2019
  • Mahdi Bidar +1
  • Preprint Article

Circuit Complexity Of Constraint Satisfaction Problems With Few Subpowers

  • May 22, 2021
  • Amir El-Aooiti
  • Conference Article
  • Citations60

Approximating CSPs with Global Cardinality Constraints Using SDP Hierarchies

  • Jan 17, 2012
  • Prasad Raghavendra +1
Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.