Info
- Utilizzare la checkbox di selezione a fianco di ciascun documento per attivare le funzionalità di stampa, invio email, download nei formati disponibili del (i) record.
Ant colony optimization and constraint programming [[electronic resource] /] / Christine Solnon
| Ant colony optimization and constraint programming [[electronic resource] /] / Christine Solnon |
| Autore | Solnon Christine |
| Pubbl/distr/stampa | London, : ISTE |
| Descrizione fisica | 1 online resource (248 p.) |
| Disciplina | 005.1/16 |
| Collana | ISTE |
| Soggetto topico |
Constraint programming (Computer science)
Mathematical optimization Swarm intelligence Ant algorithms |
| Soggetto genere / forma | Electronic books. |
| ISBN |
1-118-55756-5
1-299-31543-7 1-118-61966-8 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | pt. 1. Constraint programming -- pt. 2. Ant colony optimization -- pt. 3. CP with ACO. |
| Record Nr. | UNINA-9910139246303321 |
Solnon Christine
|
||
| London, : ISTE | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Ant colony optimization and constraint programming / / Christine Solnon
| Ant colony optimization and constraint programming / / Christine Solnon |
| Autore | Solnon Christine |
| Edizione | [1st ed.] |
| Pubbl/distr/stampa | London, : ISTE |
| Descrizione fisica | 1 online resource (248 p.) |
| Disciplina | 005.1/16 |
| Collana | ISTE |
| Soggetto topico |
Constraint programming (Computer science)
Mathematical optimization Swarm intelligence Ant algorithms |
| ISBN |
1-118-55756-5
1-299-31543-7 1-118-61966-8 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | pt. 1. Constraint programming -- pt. 2. Ant colony optimization -- pt. 3. CP with ACO. |
| Record Nr. | UNINA-9910819597103321 |
|
Solnon Christine
|
||
| London, : ISTE | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
A class of algorithms for distributed constraint optimization [[electronic resource] /] / Adrian Petcu
| A class of algorithms for distributed constraint optimization [[electronic resource] /] / Adrian Petcu |
| Autore | Petcu Adrian |
| Pubbl/distr/stampa | Washington, DC, : IOS Press, 2009 |
| Descrizione fisica | 1 online resource (304 p.) |
| Disciplina |
005.1/16
006.3 |
| Collana | Frontiers in artificial intelligence and applications/faia |
| Soggetto topico |
Constraint programming (Computer science)
Artificial intelligence |
| Soggetto genere / forma | Electronic books. |
| ISBN |
1-4416-1663-2
1-60750-418-9 600-00-1486-4 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Title page; Contents; Introduction; I Preliminaries and Background; II The DPOP Algorithm; III Tradeoffs; IV Dynamics; V Self-Interest |
| Record Nr. | UNINA-9910454828003321 |
|
Petcu Adrian
|
||
| Washington, DC, : IOS Press, 2009 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
A class of algorithms for distributed constraint optimization [[electronic resource] /] / Adrian Petcu
| A class of algorithms for distributed constraint optimization [[electronic resource] /] / Adrian Petcu |
| Autore | Petcu Adrian |
| Pubbl/distr/stampa | Washington, DC, : IOS Press, 2009 |
| Descrizione fisica | 1 online resource (304 p.) |
| Disciplina |
005.1/16
006.3 |
| Collana | Frontiers in artificial intelligence and applications/faia |
| Soggetto topico |
Constraint programming (Computer science)
Artificial intelligence |
| ISBN |
1-4416-1663-2
1-60750-418-9 600-00-1486-4 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Title page; Contents; Introduction; I Preliminaries and Background; II The DPOP Algorithm; III Tradeoffs; IV Dynamics; V Self-Interest |
| Record Nr. | UNINA-9910777938403321 |
|
Petcu Adrian
|
||
| Washington, DC, : IOS Press, 2009 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Combinatorial search : from algorithms to systems / / Youssef Hamadi
| Combinatorial search : from algorithms to systems / / Youssef Hamadi |
| Autore | Hamadi Youssef |
| Edizione | [1st ed. 2013.] |
| Pubbl/distr/stampa | Heidelberg [Germany] : , : Springer, , 2013 |
| Descrizione fisica | 1 online resource (xiii, 139 pages) : illustrations (some color) |
| Disciplina |
004
004.0151 006.3 519.6 |
| Collana | Gale eBooks |
| Soggetto topico |
Combinatorial optimization
Computer algorithms Constraint programming (Computer science) Electronic information resource searching |
| ISBN | 3-642-41482-6 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Chap. 1 - Introduction -- Chap. 2 - Boosting Distributed Constraint Networks -- Chap. 3 - Parallel Tree Search for Satisfiability -- Chap. 4 - Parallel Local Search for Satisfiability -- Chap. 5 - Learning Variables Dependencies -- Chap. 6 - Continuous Search -- Chap. 7 - Autonomous Search -- Chap. 8 - Conclusion and Perspectives. |
| Record Nr. | UNINA-9910437569503321 |
|
Hamadi Youssef
|
||
| Heidelberg [Germany] : , : Springer, , 2013 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Constraint handling in metaheuristics and applications / / Anand J. Kulkarni [and four others], editors
| Constraint handling in metaheuristics and applications / / Anand J. Kulkarni [and four others], editors |
| Pubbl/distr/stampa | Singapore : , : Springer, , [2021] |
| Descrizione fisica | 1 online resource (336 pages) |
| Disciplina | 005.11 |
| Soggetto topico |
Constraint programming (Computer science)
Metaheuristics |
| ISBN | 981-336-710-5 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNISA-996464492003316 |
| Singapore : , : Springer, , [2021] | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Constraint handling rules : current research topics / / Tom Schrijvers, Thom Frühwirth (editors)
| Constraint handling rules : current research topics / / Tom Schrijvers, Thom Frühwirth (editors) |
| Edizione | [1st ed. 2008.] |
| Pubbl/distr/stampa | Berlin ; ; Heidelberg : , : Springer, , [2008] |
| Descrizione fisica | 1 online resource (VII, 245 p.) |
| Disciplina | 005.11 |
| Collana | Lecture notes in computer science. Lecture notes in artificial intelligence |
| Soggetto topico | Constraint programming (Computer science) |
| ISBN | 3-540-92243-1 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Welcome to Constraint Handling Rules -- A Flexible Search Framework for CHR -- Adaptive CHR Meets CHR??? -- Constructing Rule-Based Solvers for Intentionally-Defined Constraints -- Implementing Probabilistic Abductive Logic Programming with Constraint Handling Rules -- A Compositional Semantics for CHR with Propagation Rules -- CHR for Imperative Host Languages -- Guard Reasoning in the Refined Operational Semantics of CHR. |
| Record Nr. | UNINA-9910483942303321 |
| Berlin ; ; Heidelberg : , : Springer, , [2008] | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Constraint handling rules : current research topics / / Tom Schrijvers, Thom Frühwirth (editors)
| Constraint handling rules : current research topics / / Tom Schrijvers, Thom Frühwirth (editors) |
| Edizione | [1st ed. 2008.] |
| Pubbl/distr/stampa | Berlin ; ; Heidelberg : , : Springer, , [2008] |
| Descrizione fisica | 1 online resource (VII, 245 p.) |
| Disciplina | 005.11 |
| Collana | Lecture notes in computer science. Lecture notes in artificial intelligence |
| Soggetto topico | Constraint programming (Computer science) |
| ISBN | 3-540-92243-1 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Welcome to Constraint Handling Rules -- A Flexible Search Framework for CHR -- Adaptive CHR Meets CHR??? -- Constructing Rule-Based Solvers for Intentionally-Defined Constraints -- Implementing Probabilistic Abductive Logic Programming with Constraint Handling Rules -- A Compositional Semantics for CHR with Propagation Rules -- CHR for Imperative Host Languages -- Guard Reasoning in the Refined Operational Semantics of CHR. |
| Record Nr. | UNISA-996466005403316 |
| Berlin ; ; Heidelberg : , : Springer, , [2008] | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Constraint networks [[electronic resource] ] : techniques and algorithms / / Christophe Lecoutre
| Constraint networks [[electronic resource] ] : techniques and algorithms / / Christophe Lecoutre |
| Autore | Lecoutre Christophe |
| Pubbl/distr/stampa | London, : ISTE |
| Descrizione fisica | 1 online resource (588 p.) |
| Disciplina |
004.6
005.116 |
| Collana | ISTE |
| Soggetto topico |
Constraint programming (Computer science)
Computer algorithms Computer networks |
| Soggetto genere / forma | Electronic books. |
| ISBN |
1-282-68408-6
9786612684081 0-470-61182-0 0-470-61038-7 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto |
Constraint Networks; Contents; Acknowledgements; Notation; Main Acronyms; List of Algorithms; Introduction; Chapter 1. Constraint Networks; 1.1. Variables and constraints; 1.2. Networks of variables and constraints; 1.2.1. Basic definitions; 1.2.2. Associated (hyper)graphs; 1.2.3. Instantiations and solutions; 1.3. Examples of constraint networks; 1.3.1. Queens problem; 1.3.2. Crossword problem; 1.3.3. Sudoku problem; 1.3.4. Edge-matching puzzles; 1.4. Partial orders, decisions, nogoods and properties; 1.4.1. Partial orders; 1.4.2. Decisions and nogoods
1.4.3. Properties on values and variables1.5. Data structures to represent constraint networks; 1.5.1. Representation of finite domains; 1.5.2. Representation of constraints; Chapter 2. Random and Structured Networks; 2.1. Random constraint networks; 2.1.1. Classical models; 2.1.2. Models RB and RD; 2.1.3. Random constraint networks in intension; 2.1.4. Benchmarks; 2.1.4.1. Random series; 2.1.4.2. Random series containing a small structure; 2.2. Structured constraint networks; 2.2.1. Backbones and backdoors; 2.2.2. Cores and cliques; 2.2.3. Acyclicity 2.2.4. Small world structure and morphing technique2.2.5. Benchmarks; 2.2.5.1. Main series; 2.2.5.2. Other series; Part one. Inference; Chapter 3. Consistencies; 3.1. Basic consistencies; 3.2. Stability of consistencies; 3.3. Domain-filtering consistencies; 3.4. Higher-order consistencies; 3.4.1. Taking the right path; 3.4.2. Relation-based consistencies; 3.5. Global consistency; 3.5.1. Identifying global consistency; 3.5.2. Toward tractability; 3.5.2.1. Relational CSP classes; 3.5.2.2. Structural CSP classes; 3.5.2.3. Hybrid CSP classes; 3.6. Caveats about node, arc and path consistencies Chapter 4. Generic GAC Algorithms4.1. Coarse-grained propagation schemes; 4.1.1. Arc-oriented propagation scheme; 4.1.2. Variable-oriented propagation scheme; 4.1.3. Applying forward checking; 4.2. Iterating over valid tuples; 4.3. GAC3 and GAC2001; 4.4. More about general-purpose GAC algorithms; 4.4.1. Important properties; 4.4.1.1. Incrementality; 4.4.1.2. Multi-directionality; 4.4.1.3. Substitutability; 4.4.2. Overview; 4.5. Improving the efficiency of generic GAC algorithms; 4.5.1. Exploiting cardinality of conflict sets; 4.5.2. Exploiting residues; 4.5.2.1. Algorithm GAC3rm 4.5.2.2. Complexity issues4.5.2.3. Residues within MAC; 4.5.3. Exploiting bitwise operations; 4.5.3.1. Binary representation; 4.5.3.2. Algorithms AC3bit and AC3bit+rm; 4.6. Experimental results; 4.7. Discussion; Chapter 5. Generalized Arc Consistency for Table Constraints; 5.1. Classical schemes; 5.1.1. Positive table constraints; 5.1.2. GAC-valid scheme; 5.1.3. GAC-allowed scheme; 5.1.4. Illustration; 5.2. Indexing-based approaches; 5.2.1. NextIn indexing; 5.2.2. NextDiff indexing; 5.3. Compression-based approaches; 5.3.1. Tries; 5.3.2. Multi-valued decision diagrams 5.3.3. Compressed tables |
| Record Nr. | UNINA-9910139510103321 |
|
Lecoutre Christophe
|
||
| London, : ISTE | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Constraint networks [[electronic resource] ] : techniques and algorithms / / Christophe Lecoutre
| Constraint networks [[electronic resource] ] : techniques and algorithms / / Christophe Lecoutre |
| Autore | Lecoutre Christophe |
| Pubbl/distr/stampa | London, : ISTE |
| Descrizione fisica | 1 online resource (588 p.) |
| Disciplina |
004.6
005.116 |
| Collana | ISTE |
| Soggetto topico |
Constraint programming (Computer science)
Computer algorithms Computer networks |
| ISBN |
1-282-68408-6
9786612684081 0-470-61182-0 0-470-61038-7 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto |
Constraint Networks; Contents; Acknowledgements; Notation; Main Acronyms; List of Algorithms; Introduction; Chapter 1. Constraint Networks; 1.1. Variables and constraints; 1.2. Networks of variables and constraints; 1.2.1. Basic definitions; 1.2.2. Associated (hyper)graphs; 1.2.3. Instantiations and solutions; 1.3. Examples of constraint networks; 1.3.1. Queens problem; 1.3.2. Crossword problem; 1.3.3. Sudoku problem; 1.3.4. Edge-matching puzzles; 1.4. Partial orders, decisions, nogoods and properties; 1.4.1. Partial orders; 1.4.2. Decisions and nogoods
1.4.3. Properties on values and variables1.5. Data structures to represent constraint networks; 1.5.1. Representation of finite domains; 1.5.2. Representation of constraints; Chapter 2. Random and Structured Networks; 2.1. Random constraint networks; 2.1.1. Classical models; 2.1.2. Models RB and RD; 2.1.3. Random constraint networks in intension; 2.1.4. Benchmarks; 2.1.4.1. Random series; 2.1.4.2. Random series containing a small structure; 2.2. Structured constraint networks; 2.2.1. Backbones and backdoors; 2.2.2. Cores and cliques; 2.2.3. Acyclicity 2.2.4. Small world structure and morphing technique2.2.5. Benchmarks; 2.2.5.1. Main series; 2.2.5.2. Other series; Part one. Inference; Chapter 3. Consistencies; 3.1. Basic consistencies; 3.2. Stability of consistencies; 3.3. Domain-filtering consistencies; 3.4. Higher-order consistencies; 3.4.1. Taking the right path; 3.4.2. Relation-based consistencies; 3.5. Global consistency; 3.5.1. Identifying global consistency; 3.5.2. Toward tractability; 3.5.2.1. Relational CSP classes; 3.5.2.2. Structural CSP classes; 3.5.2.3. Hybrid CSP classes; 3.6. Caveats about node, arc and path consistencies Chapter 4. Generic GAC Algorithms4.1. Coarse-grained propagation schemes; 4.1.1. Arc-oriented propagation scheme; 4.1.2. Variable-oriented propagation scheme; 4.1.3. Applying forward checking; 4.2. Iterating over valid tuples; 4.3. GAC3 and GAC2001; 4.4. More about general-purpose GAC algorithms; 4.4.1. Important properties; 4.4.1.1. Incrementality; 4.4.1.2. Multi-directionality; 4.4.1.3. Substitutability; 4.4.2. Overview; 4.5. Improving the efficiency of generic GAC algorithms; 4.5.1. Exploiting cardinality of conflict sets; 4.5.2. Exploiting residues; 4.5.2.1. Algorithm GAC3rm 4.5.2.2. Complexity issues4.5.2.3. Residues within MAC; 4.5.3. Exploiting bitwise operations; 4.5.3.1. Binary representation; 4.5.3.2. Algorithms AC3bit and AC3bit+rm; 4.6. Experimental results; 4.7. Discussion; Chapter 5. Generalized Arc Consistency for Table Constraints; 5.1. Classical schemes; 5.1.1. Positive table constraints; 5.1.2. GAC-valid scheme; 5.1.3. GAC-allowed scheme; 5.1.4. Illustration; 5.2. Indexing-based approaches; 5.2.1. NextIn indexing; 5.2.2. NextDiff indexing; 5.3. Compression-based approaches; 5.3.1. Tries; 5.3.2. Multi-valued decision diagrams 5.3.3. Compressed tables |
| Record Nr. | UNINA-9910830864003321 |
|
Lecoutre Christophe
|
||
| London, : ISTE | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
