An Optimal Algorithm Based on the Solution to the Coarse-Grained Arc Consistency Algorithms of the Constraint Satisfaction Problems

doi 10.2991/csic-15.2015.4
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Atlantis Press

Related search

Decidable Relationships Between Consistency Notions for Constraint Satisfaction Problems

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2009English

The Approximability of Constraint Satisfaction Problems

SIAM Journal on Computing
MathematicsComputer Science
2001English

Applications of Partial Polymorphisms in (Fine-Grained) Complexity of Constraint Satisfaction Problems

Linköping Studies in Science and Technology. Dissertations
2020English

Coarse-Grained Complexity for Dynamic Algorithms

2020English

A Coarse-Grained Parallelization of Genetic Algorithms

International Journal of Advances in Intelligent Informatics
Computer VisionPattern RecognitionHuman-Computer InteractionArtificial Intelligence
2018English

Algorithms for Constraint Satisfaction

INTELIGENCIA ARTIFICIAL
2003English

The Distributed Constraint Satisfaction Problem: Formalization and Algorithms

IEEE Transactions on Knowledge and Data Engineering
Computational TheoryComputer Science ApplicationsInformation SystemsMathematics
1998English

The Resolution Complexity of Random Constraint Satisfaction Problems

SIAM Journal on Computing
MathematicsComputer Science
2007English

A New Algorithm for Optimal Constraint Satisfaction and Its Implications

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2004English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy