Abstract domains in constraint programming / Marie Pelleau.

Constraint Programming aims at solving hard combinatorial problems, with a computation time increasing in practice exponentially. The methods are today efficient enough to solve large industrial problems, in a generic framework. However, solvers are dedicated to a single variable type: integer or re...

Full description

Saved in:
Bibliographic Details
Online Access: Full Text (via ScienceDirect)
Main Author: Pelleau, Marie (Author)
Format: eBook
Language:English
Published: London, UK : Kidlington, Oxford, UK : ISTE Press ; Elsevier, 2015.
Subjects:

Internet

Full Text (via ScienceDirect)

Online

Holdings details from Online
Call Number: QA76.612
QA76.612 Available