Amanote Research

Amanote Research

    RegisterSign In

A New Algorithm for Optimal Constraint Satisfaction and Its Implications

Lecture Notes in Computer Science - Germany
doi 10.1007/978-3-540-27836-8_101
Full Text
Open PDF
Abstract

Available in full text

Categories
Computer ScienceTheoretical Computer Science
Date

January 1, 2004

Authors
Ryan Williams
Publisher

Springer Berlin Heidelberg


Related search

An LP-Designed Algorithm for Constraint Satisfaction

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2006English

Algorithms for Constraint Satisfaction

INTELIGENCIA ARTIFICIAL
2003English

Optimization by Hybridization of a Genetic Algorithm With Constraint Satisfaction Techniques

English

Sticky Brownian Rounding and Its Applications to Constraint Satisfaction Problems

2020English

Constraint Satisfaction for Planning and Scheduling Problems

Constraints
CombinatoricsMathematicsDiscrete MathematicsComputational TheoryArtificial IntelligenceSoftware
2011English

Dynamic Flexible Constraint Satisfaction and Its Application to AI Planning

2004English

Sharp Thresholds for a Random Constraint Satisfaction Problem

Open Journal of Applied Sciences
2017English

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

2015English

A New Hybrid Distributed Double Guided Genetic Swarm Algorithm for Optimization and Constraint Reasoning

International Journal of Swarm Intelligence Research
Computational TheoryComputer Science ApplicationsArtificial IntelligenceMathematics
2012English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy