The goldilocks problem

Tudor Hulubei; Eugene C. Freuder

doi:10.1007/978-3-540-48085-3_17

The goldilocks problem

Tudor Hulubei
, Eugene C. Freuder

School of Computer Science and Information Technology

University of New Hampshire

Research output: Chapter in Book/Report/Conference proceedings › Conference proceeding › peer-review

Abstract

A lot of workin constraint satisfaction has been focused on finding solutions to difficult problems. Many real life problems however, while not extremely complicated, have a huge number of solutions, few of which are acceptable from a practical standpoint. In this paper we will present a value ordering heuristic that attempts to guide the search towards solutions that are acceptable. More specifically, by considering the weights assigned to values and pairs of values, the heuristic will guide the search towards solutions for which the total weight is within an acceptable interval.

Original language	English
Title of host publication	Principles and Practice of Constraint Programming – CP 1999 - 5th International Conference, CP 1999, Proceedings
Editors	Joxan Jaffar
Publisher	Springer Verlag
Pages	234-245
Number of pages	12
ISBN (Print)	3540666265, 9783540666264
DOIs	https://doi.org/10.1007/978-3-540-48085-3_17
Publication status	Published - 1999
Event	5th International Conference on Principles and Practice of Constraint Programming, CP 1999 - Alexandria, United States Duration: 11 Oct 1999 → 14 Oct 1999

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	1713
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	5th International Conference on Principles and Practice of Constraint Programming, CP 1999
Country/Territory	United States
City	Alexandria
Period	11/10/99 → 14/10/99

Access to Document

10.1007/978-3-540-48085-3_17

Cite this

Hulubei, T., & Freuder, E. C. (1999). The goldilocks problem. In J. Jaffar (Ed.), Principles and Practice of Constraint Programming – CP 1999 - 5th International Conference, CP 1999, Proceedings (pp. 234-245). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1713). Springer Verlag. https://doi.org/10.1007/978-3-540-48085-3_17

Hulubei, Tudor ; Freuder, Eugene C. / The goldilocks problem. Principles and Practice of Constraint Programming – CP 1999 - 5th International Conference, CP 1999, Proceedings. editor / Joxan Jaffar. Springer Verlag, 1999. pp. 234-245 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{9cd5aec34fb0458fb2c291fa483aea95,

title = "The goldilocks problem",

abstract = "A lot of workin constraint satisfaction has been focused on finding solutions to difficult problems. Many real life problems however, while not extremely complicated, have a huge number of solutions, few of which are acceptable from a practical standpoint. In this paper we will present a value ordering heuristic that attempts to guide the search towards solutions that are acceptable. More specifically, by considering the weights assigned to values and pairs of values, the heuristic will guide the search towards solutions for which the total weight is within an acceptable interval.",

author = "Tudor Hulubei and Freuder, \{Eugene C.\}",

note = "Publisher Copyright: {\textcopyright} Springer-Verlag Berlin Heidelberg 1999.; 5th International Conference on Principles and Practice of Constraint Programming, CP 1999 ; Conference date: 11-10-1999 Through 14-10-1999",

year = "1999",

doi = "10.1007/978-3-540-48085-3\_17",

language = "English",

isbn = "3540666265",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "234--245",

editor = "Joxan Jaffar",

booktitle = "Principles and Practice of Constraint Programming – CP 1999 - 5th International Conference, CP 1999, Proceedings",

address = "Germany",

}

Hulubei, T & Freuder, EC 1999, The goldilocks problem. in J Jaffar (ed.), Principles and Practice of Constraint Programming – CP 1999 - 5th International Conference, CP 1999, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 1713, Springer Verlag, pp. 234-245, 5th International Conference on Principles and Practice of Constraint Programming, CP 1999, Alexandria, United States, 11/10/99. https://doi.org/10.1007/978-3-540-48085-3_17

The goldilocks problem. / Hulubei, Tudor; Freuder, Eugene C.
Principles and Practice of Constraint Programming – CP 1999 - 5th International Conference, CP 1999, Proceedings. ed. / Joxan Jaffar. Springer Verlag, 1999. p. 234-245 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1713).

Research output: Chapter in Book/Report/Conference proceedings › Conference proceeding › peer-review

TY - GEN

T1 - The goldilocks problem

AU - Hulubei, Tudor

AU - Freuder, Eugene C.

N1 - Publisher Copyright: © Springer-Verlag Berlin Heidelberg 1999.

PY - 1999

Y1 - 1999

N2 - A lot of workin constraint satisfaction has been focused on finding solutions to difficult problems. Many real life problems however, while not extremely complicated, have a huge number of solutions, few of which are acceptable from a practical standpoint. In this paper we will present a value ordering heuristic that attempts to guide the search towards solutions that are acceptable. More specifically, by considering the weights assigned to values and pairs of values, the heuristic will guide the search towards solutions for which the total weight is within an acceptable interval.

AB - A lot of workin constraint satisfaction has been focused on finding solutions to difficult problems. Many real life problems however, while not extremely complicated, have a huge number of solutions, few of which are acceptable from a practical standpoint. In this paper we will present a value ordering heuristic that attempts to guide the search towards solutions that are acceptable. More specifically, by considering the weights assigned to values and pairs of values, the heuristic will guide the search towards solutions for which the total weight is within an acceptable interval.

UR - https://www.scopus.com/pages/publications/0037544256

U2 - 10.1007/978-3-540-48085-3_17

DO - 10.1007/978-3-540-48085-3_17

M3 - Conference proceeding

AN - SCOPUS:0037544256

SN - 3540666265

SN - 9783540666264

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 234

EP - 245

BT - Principles and Practice of Constraint Programming – CP 1999 - 5th International Conference, CP 1999, Proceedings

A2 - Jaffar, Joxan

PB - Springer Verlag

T2 - 5th International Conference on Principles and Practice of Constraint Programming, CP 1999

Y2 - 11 October 1999 through 14 October 1999

ER -

Hulubei T, Freuder EC. The goldilocks problem. In Jaffar J, editor, Principles and Practice of Constraint Programming – CP 1999 - 5th International Conference, CP 1999, Proceedings. Springer Verlag. 1999. p. 234-245. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-540-48085-3_17

The goldilocks problem

Abstract

Publication series

Conference

Access to Document

Other files and links

Fingerprint

Cite this