ML Anthology

Neighborhood Interchangeability and Dynamic Bundling for Non-Binary Finite CSPs

Anagh Lal, Berthe Y. Choueiry, Eugene C. Freuder
AAAI 2005 pp. 397-404
/aaai/2005/lal2005aaai-neighborhood/

Abstract

A Constraint Satisfaction Problem (CSP) is a combinatorial decision problem defined by a set of variables, a set of domain values for these variables, and a set of constraints restricting the allowable combinations of values for variables, where the task is to find a solution (i.e., an assignment of a value to each variable satisfying all constraints), or to find all such solutions. Neighborhood Interchangeability and Dynamic Bundling for Non-binary CSPs S c d, e, f

PDF AAAI Semantic Scholar

Cite

Text

Lal et al. "Neighborhood Interchangeability and Dynamic Bundling for Non-Binary Finite CSPs." AAAI Conference on Artificial Intelligence, 2005.

Markdown

[Lal et al. "Neighborhood Interchangeability and Dynamic Bundling for Non-Binary Finite CSPs." AAAI Conference on Artificial Intelligence, 2005.](https://mlanthology.org/aaai/2005/lal2005aaai-neighborhood/)

BibTeX

@inproceedings{lal2005aaai-neighborhood,
  title     = {{Neighborhood Interchangeability and Dynamic Bundling for Non-Binary Finite CSPs}},
  author    = {Lal, Anagh and Choueiry, Berthe Y. and Freuder, Eugene C.},
  booktitle = {AAAI Conference on Artificial Intelligence},
  year      = {2005},
  pages     = {397-404},
  url       = {https://mlanthology.org/aaai/2005/lal2005aaai-neighborhood/}
}