Title

Anytime algorithms for maximal constraint satisfaction problems

Author

Noha Kaptan

Department

Computer Science & Engineering Department

Degree Name

MS in Computer Science

Date of Award

2-1-2001

Online Submission Date

January 2000

Document Type

Thesis

Extent

123 leaves :

Library of Congress Subject Heading 1

Algorithms.

Rights

The author retains all rights with regard to copyright. The author certifies that written permission from the owner(s) of third-party copyrighted matter included in the thesis, dissertation, paper, or record of study has been obtained. The author further certifies that IRB approval has been obtained for this thesis, or that IRB approval is not necessary for this thesis. Insofar as this thesis, dissertation, paper, or record of study is an educational record as defined in the Family Educational Rights and Privacy Act (FERPA) (20 USC 1232g), the author has granted consent to disclosure of it to anyone who requests a copy.

Recommended Citation

APA Citation

Kaptan, N. (2001).Anytime algorithms for maximal constraint satisfaction problems [Thesis, the American University in Cairo]. AUC Knowledge Fountain.
https://fount.aucegypt.edu/retro_etds/1463

MLA Citation

Kaptan, Noha. Anytime algorithms for maximal constraint satisfaction problems. 2001. American University in Cairo, Thesis. AUC Knowledge Fountain.
https://fount.aucegypt.edu/retro_etds/1463

Call Number

Thesis 2000/71

Location

mgfth;mgfth