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.
Evolutionary Computation in Combinatorial Optimization [[electronic resource] ] : 10th European Conference, EvoCOP 2010, Istanbul, Turkey, April 7-9, 2010, Proceedings / / edited by Peter I. Cowling, Peter Merz
| Evolutionary Computation in Combinatorial Optimization [[electronic resource] ] : 10th European Conference, EvoCOP 2010, Istanbul, Turkey, April 7-9, 2010, Proceedings / / edited by Peter I. Cowling, Peter Merz |
| Edizione | [1st ed. 2010.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2010 |
| Descrizione fisica | 1 online resource (XII, 290 p. 67 illus.) |
| Disciplina | 005.1 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Algorithms
Computer science Pattern recognition systems Computer vision Computer science—Mathematics Discrete mathematics Theory of Computation Automated Pattern Recognition Computer Vision Discrete Mathematics in Computer Science |
| ISBN |
1-280-38599-5
9786613563910 3-642-12139-X |
| Classificazione |
54.10
31.12 31.76 30.10 DAT 718f MAT 913f MAT 919f SS 4800 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Dual Sequence Simulated Annealing with Round-Robin Approach for University Course Timetabling -- Heuristic and Exact Methods for the Discrete (r |p)-Centroid Problem -- On the Benefit of Sub-optimality within the Divide-and-Evolve Scheme -- A Real-Integer-Discrete-Coded Differential Evolution Algorithm: A Preliminary Study -- Fitness Distance Correlation and Search Space Analysis for Permutation Based Problems -- A Genetic Algorithm to Minimize Chromatic Entropy -- Evolutionary Approaches to the Three-dimensional Multi-pipe Routing Problem: A Comparative Study Using Direct Encodings -- A Tabu Search Heuristic for Point Coverage, Sink Location, and Data Routing in Wireless Sensor Networks -- Ant Colony Optimization for Tree Decompositions -- Iterated Local Search with Path Relinking for Solving Parallel Machines Scheduling Problem with Resource-Assignable Sequence Dependent Setup Times -- Enhancing a Tabu Algorithm for Approximate Graph Matching by Using Similarity Measures -- Characterizing Fault-Tolerance of Genetic Algorithms in Desktop Grid Systems -- The Office-Space-Allocation Problem in Strongly Hierarchized Organizations -- A Study of Memetic Search with Multi-parent Combination for UBQP -- Bicriteria Scheduling Problem on the Two-Machine Flowshop Using Simulated Annealing -- A Memetic Algorithm for Workforce Distribution in Dynamic Multi-Skill Call Centres -- Geometric Generalization of the Nelder-Mead Algorithm -- Guided Ejection Search for the Pickup and Delivery Problem with Time Windows -- An Evolutionary Algorithm Guided by Preferences Elicited According to the ELECTRE TRI Method Principles -- Multilevel Variable Neighborhood Search for Periodic Routing Problems -- Enhancing Genetic Algorithms by a Trie-Based Complete Solution Archive -- A New Primal-Dual Genetic Algorithm: Case Study for the Winner Determination Problem -- Local Search Algorithms on Graphics Processing Units. A Case Study: The Permutation Perceptron Problem -- Efficient Cycle Search for the Minimum Routing Cost Spanning Tree Problem. |
| Record Nr. | UNINA-9910483991103321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2010 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
List Decoding of Error-Correcting Codes [[electronic resource] ] : Winning Thesis of the 2002 ACM Doctoral Dissertation Competition / / by Venkatesan Guruswami
| List Decoding of Error-Correcting Codes [[electronic resource] ] : Winning Thesis of the 2002 ACM Doctoral Dissertation Competition / / by Venkatesan Guruswami |
| Autore | Guruswami Venkatesan |
| Edizione | [1st ed. 2005.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2005 |
| Descrizione fisica | 1 online resource (XX, 352 p.) |
| Disciplina | 005.7/2 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Data structures (Computer science)
Coding theory Information theory Algorithms Computers Computer science—Mathematics Data Structures and Information Theory Coding and Information Theory Algorithm Analysis and Problem Complexity Models and Principles Discrete Mathematics in Computer Science |
| ISBN | 3-540-30180-1 |
| Classificazione | 54.10 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | 1 Introduction -- 1 Introduction -- 2 Preliminaries and Monograph Structure -- I Combinatorial Bounds -- 3 Johnson-Type Bounds and Applications to List Decoding -- 4 Limits to List Decodability -- 5 List Decodability Vs. Rate -- II Code Constructions and Algorithms -- 6 Reed-Solomon and Algebraic-Geometric Codes -- 7 A Unified Framework for List Decoding of Algebraic Codes -- 8 List Decoding of Concatenated Codes -- 9 New, Expander-Based List Decodable Codes -- 10 List Decoding from Erasures -- III Applications -- Interlude -- III Applications -- 11 Linear-Time Codes for Unique Decoding -- 12 Sample Applications Outside Coding Theory -- 13 Concluding Remarks -- A GMD Decoding of Concatenated Codes. |
| Record Nr. | UNISA-996466073403316 |
Guruswami Venkatesan
|
||
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2005 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
List Decoding of Error-Correcting Codes [[electronic resource] ] : Winning Thesis of the 2002 ACM Doctoral Dissertation Competition / / by Venkatesan Guruswami
| List Decoding of Error-Correcting Codes [[electronic resource] ] : Winning Thesis of the 2002 ACM Doctoral Dissertation Competition / / by Venkatesan Guruswami |
| Autore | Guruswami Venkatesan |
| Edizione | [1st ed. 2005.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2005 |
| Descrizione fisica | 1 online resource (XX, 352 p.) |
| Disciplina | 005.7/2 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Data structures (Computer science)
Coding theory Information theory Algorithms Computers Computer science—Mathematics Data Structures and Information Theory Coding and Information Theory Algorithm Analysis and Problem Complexity Models and Principles Discrete Mathematics in Computer Science |
| ISBN | 3-540-30180-1 |
| Classificazione | 54.10 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | 1 Introduction -- 1 Introduction -- 2 Preliminaries and Monograph Structure -- I Combinatorial Bounds -- 3 Johnson-Type Bounds and Applications to List Decoding -- 4 Limits to List Decodability -- 5 List Decodability Vs. Rate -- II Code Constructions and Algorithms -- 6 Reed-Solomon and Algebraic-Geometric Codes -- 7 A Unified Framework for List Decoding of Algebraic Codes -- 8 List Decoding of Concatenated Codes -- 9 New, Expander-Based List Decodable Codes -- 10 List Decoding from Erasures -- III Applications -- Interlude -- III Applications -- 11 Linear-Time Codes for Unique Decoding -- 12 Sample Applications Outside Coding Theory -- 13 Concluding Remarks -- A GMD Decoding of Concatenated Codes. |
| Record Nr. | UNINA-9910483044903321 |
|
Guruswami Venkatesan
|
||
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2005 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Modular Algorithms in Symbolic Summation and Symbolic Integration [[electronic resource] /] / by Jürgen Gerhard
| Modular Algorithms in Symbolic Summation and Symbolic Integration [[electronic resource] /] / by Jürgen Gerhard |
| Autore | Gerhard Jürgen |
| Edizione | [1st ed. 2005.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2005 |
| Descrizione fisica | 1 online resource (XVI, 228 p.) |
| Disciplina | 005.1 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Algorithms
Numerical analysis Computer science—Mathematics Computer mathematics Algorithm Analysis and Problem Complexity Numeric Computing Symbolic and Algebraic Manipulation Computational Science and Engineering |
| ISBN | 3-540-30137-2 |
| Classificazione | 54.10 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | 1. Introduction -- 2. Overview -- 3. Technical Prerequisites -- 4. Change of Basis -- 5. Modular Squarefree and Greatest Factorial Factorization -- 6. Modular Hermite Integration -- 7. Computing All Integral Roots of the Resultant -- 8. Modular Algorithms for the Gosper-Petkovšek Form -- 9. Polynomial Solutions of Linear First Order Equations -- 10. Modular Gosper and Almkvist & Zeilberger Algorithms. |
| Record Nr. | UNISA-996466367803316 |
|
Gerhard Jürgen
|
||
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2005 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Modular Algorithms in Symbolic Summation and Symbolic Integration [[electronic resource] /] / by Jürgen Gerhard
| Modular Algorithms in Symbolic Summation and Symbolic Integration [[electronic resource] /] / by Jürgen Gerhard |
| Autore | Gerhard Jürgen |
| Edizione | [1st ed. 2005.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2005 |
| Descrizione fisica | 1 online resource (XVI, 228 p.) |
| Disciplina | 005.1 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Algorithms
Numerical analysis Computer science—Mathematics Computer mathematics Algorithm Analysis and Problem Complexity Numeric Computing Symbolic and Algebraic Manipulation Computational Science and Engineering |
| ISBN | 3-540-30137-2 |
| Classificazione | 54.10 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | 1. Introduction -- 2. Overview -- 3. Technical Prerequisites -- 4. Change of Basis -- 5. Modular Squarefree and Greatest Factorial Factorization -- 6. Modular Hermite Integration -- 7. Computing All Integral Roots of the Resultant -- 8. Modular Algorithms for the Gosper-Petkovšek Form -- 9. Polynomial Solutions of Linear First Order Equations -- 10. Modular Gosper and Almkvist & Zeilberger Algorithms. |
| Record Nr. | UNINA-9910483416303321 |
|
Gerhard Jürgen
|
||
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2005 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Quantum Computation and Information [[electronic resource] ] : From Theory to Experiment / / edited by Hiroshi Imai, Masahito Hayashi
| Quantum Computation and Information [[electronic resource] ] : From Theory to Experiment / / edited by Hiroshi Imai, Masahito Hayashi |
| Edizione | [1st ed. 2006.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2006 |
| Descrizione fisica | 1 online resource (293 p.) |
| Disciplina | 004.1 |
| Collana | Topics in Applied Physics |
| Soggetto topico |
Quantum physics
Quantum computers Spintronics Engineering Computer mathematics Quantum Physics Quantum Information Technology, Spintronics Engineering, general Computational Mathematics and Numerical Analysis |
| ISBN |
1-280-62730-1
9786610627301 3-540-33133-6 |
| Classificazione |
54.10
33.25 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Quantum Computation -- Quantum Identification of Boolean Oracles -- Query Complexity of Quantum Biased Oracles -- Quantum Information -- Quantum Statistical Inference -- Quantum Cloning Machines -- Entanglement and Quantum Error Correction -- On Additivity Questions -- Quantum Security -- Quantum Computational Cryptography -- Quantum Key Distribution: Security, Feasibility and Robustness -- Why Quantum Steganography Can Be Stronger Than Classical Steganography -- Realization of Quantum Information System -- Photonic Realization of Quantum Information Systems. |
| Record Nr. | UNINA-9910634040403321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2006 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
A short introduction to quantum information and quantum computation / / Michel Le Bellac ; translated by Patricia de Forcrand-Millard [[electronic resource]]
| A short introduction to quantum information and quantum computation / / Michel Le Bellac ; translated by Patricia de Forcrand-Millard [[electronic resource]] |
| Autore | Le Bellac Michel |
| Pubbl/distr/stampa | Cambridge : , : Cambridge University Press, , 2006 |
| Descrizione fisica | 1 online resource (x, 167 pages) : digital, PDF file(s) |
| Disciplina | 004.1 |
| Soggetto topico |
Quantum computers
Quantum theory |
| ISBN |
1-107-16766-3
0-511-75536-8 0-511-64846-4 0-511-21941-5 0-511-56896-7 0-511-22009-X |
| Classificazione |
54.51
33.23 54.10 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Cover; Half-title; Title; Copyright; Contents; Foreword; Preface; 1 Introduction; 2 What is a qubit?; 3 Manipulating qubits; 4 Quantum correlations; 5 Introduction to quantum computing; 6 Physical realizations; 7 Quantum information; References; Index |
| Altri titoli varianti | A Short Introduction to Quantum Information & Quantum Computation |
| Record Nr. | UNINA-9910784341003321 |
|
Le Bellac Michel
|
||
| Cambridge : , : Cambridge University Press, , 2006 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
A short introduction to quantum information and quantum computation / / Michel Le Bellac ; translated by Patricia de Forcrand-Millard [[electronic resource]]
| A short introduction to quantum information and quantum computation / / Michel Le Bellac ; translated by Patricia de Forcrand-Millard [[electronic resource]] |
| Autore | Le Bellac Michel |
| Pubbl/distr/stampa | Cambridge : , : Cambridge University Press, , 2006 |
| Descrizione fisica | 1 online resource (x, 167 pages) : digital, PDF file(s) |
| Disciplina | 004.1 |
| Soggetto topico |
Quantum computers
Quantum theory |
| ISBN |
1-107-16766-3
0-511-75536-8 0-511-64846-4 0-511-21941-5 0-511-56896-7 0-511-22009-X |
| Classificazione |
54.51
33.23 54.10 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Cover; Half-title; Title; Copyright; Contents; Foreword; Preface; 1 Introduction; 2 What is a qubit?; 3 Manipulating qubits; 4 Quantum correlations; 5 Introduction to quantum computing; 6 Physical realizations; 7 Quantum information; References; Index |
| Altri titoli varianti | A Short Introduction to Quantum Information & Quantum Computation |
| Record Nr. | UNINA-9910824267903321 |
|
Le Bellac Michel
|
||
| Cambridge : , : Cambridge University Press, , 2006 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Theoretical Computer Science [[electronic resource] ] : 9th Italian Conference, ICTCS 2005, Siena, Italy, October 12-14, 2005, Proceedings / / edited by Mario Coppo, Elena Lodi, G. Michele Pinna
| Theoretical Computer Science [[electronic resource] ] : 9th Italian Conference, ICTCS 2005, Siena, Italy, October 12-14, 2005, Proceedings / / edited by Mario Coppo, Elena Lodi, G. Michele Pinna |
| Edizione | [1st ed. 2005.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2005 |
| Descrizione fisica | 1 online resource (XI, 411 p.) |
| Disciplina | 004 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science
Artificial intelligence—Data processing Algorithms Machine theory Theory of Computation Data Science Computer Science Logic and Foundations of Programming Formal Languages and Automata Theory |
| ISBN |
3-540-32024-5
3-540-29106-7 |
| Classificazione | 54.10 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Contributions -- Semantic Subtyping: Challenges, Perspectives, and Open Problems -- Biological Systems as Reactive Systems -- Mobile Agents Computing: Security Issues and Algorithmic Solutions -- Technical Contributions -- Efficient Algorithms for Detecting Regular Point Configurations -- Pickup and Delivery for Moving Objects on Broken Lines -- A Static Analysis of PKI-Based Systems -- Subtyping Object and Recursive Types Logically -- The Language ?: Circuits, Computations and Classical Logic -- Checking Risky Events Is Enough for Local Policies -- The Graph Rewriting Calculus: Confluence and Expressiveness -- Safe Object Composition in the Presence of Subtyping -- Reachability Analysis in Boxed Ambients -- Error Mining for Regular Expression Patterns -- Reconstructing an Alternate Periodical Binary Matrix from Its Orthogonal Projections -- Inapproximability Results for the Lateral Gene Transfer Problem -- Faster Deterministic Wakeup in Multiple Access Channels -- Weighted Coloring: Further Complexity and Approximability Results -- Quantum Algorithms for a Set of Group Theoretic Problems -- On the Computational Complexity of the L (2,1)-Labeling Problem for Regular Graphs -- A Polymerase Based Algorithm for SAT -- Laxity Helps in Broadcast Scheduling -- Enforcing and Defying Associativity, Commutativity, Totality, and Strong Noninvertibility for One-Way Functions in Complexity Theory -- Synthesis from Temporal Specifications Using Preferred Answer Set Programming -- Model Checking Strategic Abilities of Agents Under Incomplete Information -- Improved Algorithms for Polynomial-Time Decay and Time-Decay with Additive Error -- A Theoretical Analysis of Alignment and Edit Problems for Trees -- A Complete Formulation of Generalized Affine Equivalence -- A New Combinatorial Approach to Sequence Comparison -- A Typed Assembly Language for Non-interference -- Improved Exact Exponential Algorithms for Vertex Bipartization and Other Problems -- A Typed Semantics of Higher-Order Store and Subtyping -- Two Variables Are Not Enough. |
| Record Nr. | UNISA-996465861903316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2005 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Theoretical Computer Science [[electronic resource] ] : 9th Italian Conference, ICTCS 2005, Siena, Italy, October 12-14, 2005, Proceedings / / edited by Mario Coppo, Elena Lodi, G. Michele Pinna
| Theoretical Computer Science [[electronic resource] ] : 9th Italian Conference, ICTCS 2005, Siena, Italy, October 12-14, 2005, Proceedings / / edited by Mario Coppo, Elena Lodi, G. Michele Pinna |
| Edizione | [1st ed. 2005.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2005 |
| Descrizione fisica | 1 online resource (XI, 411 p.) |
| Disciplina | 004 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science
Artificial intelligence—Data processing Algorithms Machine theory Theory of Computation Data Science Computer Science Logic and Foundations of Programming Formal Languages and Automata Theory |
| ISBN |
3-540-32024-5
3-540-29106-7 |
| Classificazione | 54.10 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Contributions -- Semantic Subtyping: Challenges, Perspectives, and Open Problems -- Biological Systems as Reactive Systems -- Mobile Agents Computing: Security Issues and Algorithmic Solutions -- Technical Contributions -- Efficient Algorithms for Detecting Regular Point Configurations -- Pickup and Delivery for Moving Objects on Broken Lines -- A Static Analysis of PKI-Based Systems -- Subtyping Object and Recursive Types Logically -- The Language ?: Circuits, Computations and Classical Logic -- Checking Risky Events Is Enough for Local Policies -- The Graph Rewriting Calculus: Confluence and Expressiveness -- Safe Object Composition in the Presence of Subtyping -- Reachability Analysis in Boxed Ambients -- Error Mining for Regular Expression Patterns -- Reconstructing an Alternate Periodical Binary Matrix from Its Orthogonal Projections -- Inapproximability Results for the Lateral Gene Transfer Problem -- Faster Deterministic Wakeup in Multiple Access Channels -- Weighted Coloring: Further Complexity and Approximability Results -- Quantum Algorithms for a Set of Group Theoretic Problems -- On the Computational Complexity of the L (2,1)-Labeling Problem for Regular Graphs -- A Polymerase Based Algorithm for SAT -- Laxity Helps in Broadcast Scheduling -- Enforcing and Defying Associativity, Commutativity, Totality, and Strong Noninvertibility for One-Way Functions in Complexity Theory -- Synthesis from Temporal Specifications Using Preferred Answer Set Programming -- Model Checking Strategic Abilities of Agents Under Incomplete Information -- Improved Algorithms for Polynomial-Time Decay and Time-Decay with Additive Error -- A Theoretical Analysis of Alignment and Edit Problems for Trees -- A Complete Formulation of Generalized Affine Equivalence -- A New Combinatorial Approach to Sequence Comparison -- A Typed Assembly Language for Non-interference -- Improved Exact Exponential Algorithms for Vertex Bipartization and Other Problems -- A Typed Semantics of Higher-Order Store and Subtyping -- Two Variables Are Not Enough. |
| Record Nr. | UNINA-9910484051303321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2005 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
