Combining Systematic and Local Search for Approximately Solving Fuzzy Constraint Satisfaction Problems

Transactions of the Japanese Society for Artificial Intelligence - Japan
doi 10.1527/tjsai.21.20
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Japanese Society for Artificial Intelligence

Related search

Solving Partial Constraint Satisfaction Problems With Tree Decomposition

Networks
Information SystemsComputer NetworksHardwareCommunicationsArchitectureSoftware
2002English

Towards Sequence-To-Sequence Reinforcement Learning for Constraint Solving With Constraint-Based Local Search

Proceedings of the AAAI Conference on Artificial Intelligence
2019English

Constraint Satisfaction for Planning and Scheduling Problems

Constraints
CombinatoricsMathematicsDiscrete MathematicsComputational TheoryArtificial IntelligenceSoftware
2011English

Solving Math Problems Approximately: A Developmental Perspective

PLoS ONE
Multidisciplinary
2016English

An Automaton Constraint for Local Search

Fundamenta Informaticae
Information SystemsAlgebraNumber TheoryMathematicsComputational TheoryTheoretical Computer Science
2011English

Towards Solving Similarity Search Problems Using Fuzzy Concept for Multi-Dimensional Data

2009English

Failure Analysis in Backtrack Search for Constraint Satisfaction

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2006English

Solution Neighbourhoods for Constraint-Directed Local Search

2012English

The Approximability of Constraint Satisfaction Problems

SIAM Journal on Computing
MathematicsComputer Science
2001English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy