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.
COMPASS '19 : proceedings of the 2019 Conference on Computing & Sustainable Societies : July 3-5, 2019, Accra, Ghana / / Jay Chen, Jennifer Mankoff, Carla Gomes
| COMPASS '19 : proceedings of the 2019 Conference on Computing & Sustainable Societies : July 3-5, 2019, Accra, Ghana / / Jay Chen, Jennifer Mankoff, Carla Gomes |
| Autore | Chen Jay |
| Pubbl/distr/stampa | New York, New York : , : Association for Computing Machinery, , 2019 |
| Descrizione fisica | 1 online resource (290 pages) : illustrations |
| Disciplina | 628 |
| Soggetto topico |
Green technology
Information technology - Environmental aspects Sustainable living - Data processing |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNINA-9910412068303321 |
Chen Jay
|
||
| New York, New York : , : Association for Computing Machinery, , 2019 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems [[electronic resource] ] : 10th International Conference, CPAIOR 2013, Yorktown Heights, NY, USA, May 18-22, 2013. Proceedings / / edited by Carla Gomes, Meinolf Sellmann
| Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems [[electronic resource] ] : 10th International Conference, CPAIOR 2013, Yorktown Heights, NY, USA, May 18-22, 2013. Proceedings / / edited by Carla Gomes, Meinolf Sellmann |
| Edizione | [1st ed. 2013.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2013 |
| Descrizione fisica | 1 online resource (XII, 403 p. 74 illus.) |
| Disciplina | 658.53 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Numerical analysis
Computer science—Mathematics Discrete mathematics Algorithms Artificial intelligence Operations research Management science Numerical Analysis Mathematical Applications in Computer Science Discrete Mathematics in Computer Science Artificial Intelligence Operations Research, Management Science |
| ISBN | 3-642-38171-5 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNISA-996466178603316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2013 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems : 10th International Conference, CPAIOR 2013, Yorktown Heights, NY, USA, May 18-22, 2013. Proceedings / / edited by Carla Gomes, Meinolf Sellmann
| Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems : 10th International Conference, CPAIOR 2013, Yorktown Heights, NY, USA, May 18-22, 2013. Proceedings / / edited by Carla Gomes, Meinolf Sellmann |
| Edizione | [1st ed. 2013.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2013 |
| Descrizione fisica | 1 online resource (XII, 403 p. 74 illus.) |
| Disciplina | 658.53 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Numerical analysis
Computer science—Mathematics Discrete mathematics Algorithms Artificial intelligence Operations research Management science Numerical Analysis Mathematical Applications in Computer Science Discrete Mathematics in Computer Science Artificial Intelligence Operations Research, Management Science |
| ISBN | 3-642-38171-5 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNINA-9910483888003321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2013 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Proceedings of the AI for an Intelligent Planet
| Proceedings of the AI for an Intelligent Planet |
| Pubbl/distr/stampa | [Place of publication not identified], : ACM, 2011 |
| Descrizione fisica | 1 online resource (47 pages) |
| Collana | ACM Other conferences |
| Soggetto topico |
Engineering & Applied Sciences
Computer Science |
| ISBN | 1-4503-0874-0 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Altri titoli varianti | AIIP '11 AI for an Intelligent Planet in conjunction with IJCAI 2011, Barcelona, Spain-July 18, 2011 |
| Record Nr. | UNINA-9910376522003321 |
| [Place of publication not identified], : ACM, 2011 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Theory and applications of satisfiability testing--SAT 2006 : 9th international conference, Seattle, WA, USA, August 12-15, 2006 : proceedings / / Armin Biere, Carla P. Gomes (eds.)
| Theory and applications of satisfiability testing--SAT 2006 : 9th international conference, Seattle, WA, USA, August 12-15, 2006 : proceedings / / Armin Biere, Carla P. Gomes (eds.) |
| Edizione | [1st ed. 2006.] |
| Pubbl/distr/stampa | Berlin, : Springer, 2006 |
| Descrizione fisica | 1 online resource (XII, 440 p.) |
| Disciplina | 511.3 |
| Altri autori (Persone) |
BiereArmin
GomesCarla |
| Collana |
Lecture notes in computer science
LNCS sublibrary. SL 1, Theoretical computer science and general issues |
| Soggetto topico |
Propositional calculus
Decision making Computer algorithms Algebra, Boolean |
| ISBN | 3-540-37207-5 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Talks -- From Propositional Satisfiability to Satisfiability Modulo Theories -- CSPs: Adding Structure to SAT -- Session 1. Proofs and Cores -- Complexity of Semialgebraic Proofs with Restricted Degree of Falsity -- Categorisation of Clauses in Conjunctive Normal Forms: Minimally Unsatisfiable Sub-clause-sets and the Lean Kernel -- A Scalable Algorithm for Minimal Unsatisfiable Core Extraction -- Minimum Witnesses for Unsatisfiable 2CNFs -- Preliminary Report on Input Cover Number as a Metric for Propositional Resolution Proofs -- Extended Resolution Proofs for Symbolic SAT Solving with Quantification -- Session 2. Heuristics and Algorithms -- Encoding CNFs to Empower Component Analysis -- Satisfiability Checking of Non-clausal Formulas Using General Matings -- Determinization of Resolution by an Algorithm Operating on Complete Assignments -- A Complete Random Jump Strategy with Guiding Paths -- Session 3. Applications -- Applications of SAT Solvers to Cryptanalysis of Hash Functions -- Functional Treewidth: Bounding Complexity in the Presence of Functional Dependencies -- Encoding the Satisfiability of Modal and Description Logics into SAT: The Case Study of K(m)/ -- SAT in Bioinformatics: Making the Case with Haplotype Inference -- Session 4. SMT -- Lemma Learning in SMT on Linear Constraints -- On SAT Modulo Theories and Optimization Problems -- Fast and Flexible Difference Constraint Propagation for DPLL(T) -- A Progressive Simplifier for Satisfiability Modulo Theories -- Session 5. Structure -- Dependency Quantified Horn Formulas: Models and Complexity -- On Linear CNF Formulas -- A Dichotomy Theorem for Typed Constraint Satisfaction Problems -- Session 6. MAX-SAT -- A Complete Calculus for Max-SAT -- On Solving the Partial MAX-SAT Problem -- MAX-SAT for Formulas with Constant Clause Density Can Be Solved Faster Than in Time -- Average-Case Analysis for the MAX-2SAT Problem -- Session 7. Local Search and Survey Propagation -- Local Search for Unsatisfiability -- Efficiency of Local Search -- Implementing Survey Propagation on Graphics Processing Units -- Characterizing Propagation Methods for Boolean Satisfiability -- Session 8. QBF -- Minimal False Quantified Boolean Formulas -- Binary Clause Reasoning in QBF -- Solving Quantified Boolean Formulas with Circuit Observability Don’t Cares -- QBF Modeling: Exploiting Player Symmetry for Simplicity and Efficiency -- Session 9. Counting and Concurrency -- Solving #SAT Using Vertex Covers -- Counting Models in Integer Domains -- sharpSAT – Counting Models with Advanced Component Caching and Implicit BCP -- A Distribution Method for Solving SAT in Grids. |
| Altri titoli varianti | SAT 2006 |
| Record Nr. | UNINA-9910484504903321 |
| Berlin, : Springer, 2006 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||