Handling arithmetic binary and non-binary constraints in quantified constraint satisfaction problems :

Handling arithmetic binary and non-binary constraints in quantified constraint satisfaction problems : μεταπτυχιακή διατριβή

Researchers have developed many strategies for solving combinatorial problems based on Constraint Satisfaction Problems (CSPs) ([5], [10], [12]). This approach has proved to be very effective in many real-world problems. Recently, the scientific community has started to take on a harder task, the on...

Full description

Saved in:
Bibliographic Details
Main Author: Τσοπανάκης, Κώστας
Corporate Author: Πανεπιστήμιο Αιγαίου. Σχολή Θετικών Επιστημών. Τμήμα Μηχανικών Πληροφοριακών και Επικοινωνιακών Συστημάτων
Other Authors: Τσιρίδη, Αγγελίνα
Format: Thesis Book
Language:English
Published: Καρλόβασι, Σάμος : Πανεπιστήμιο Αιγαίου, Τμήμα Μηχανικών Πληροφοριακών και Επικοινωνιακών Συστημάτων, 2005.
Subjects:
University of the Aegean > Dissertations.
Constraint programming (Computer science)
Dissertations, Academic > Greece.
Online Access:http://hdl.handle.net/11610/12499
Tags: Add Tag
No Tags, Be the first to tag this record!

Internet

http://hdl.handle.net/11610/12499

Similar Items