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.
Combinatorics, Algorithms, Probabilistic and Experimental Methodologies [[electronic resource] ] : First International Symposium, ESCAPE 2007, Hangzhou, China, April 7-9, 2007, Revised Selected Papers / / edited by Bo Chen, Mike Paterson, Guochuan Zhang
| Combinatorics, Algorithms, Probabilistic and Experimental Methodologies [[electronic resource] ] : First International Symposium, ESCAPE 2007, Hangzhou, China, April 7-9, 2007, Revised Selected Papers / / edited by Bo Chen, Mike Paterson, Guochuan Zhang |
| Edizione | [1st ed. 2007.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2007 |
| Descrizione fisica | 1 online resource (XII, 530 p.) |
| Disciplina | 511.6 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Algorithms
Pattern recognition systems Computer simulation Data mining Bioinformatics Automated Pattern Recognition Computer Modelling Data Mining and Knowledge Discovery Computational and Systems Biology |
| ISBN | 3-540-74450-9 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | The Tight Bound of First Fit Decreasing Bin-Packing Algorithm Is FFD(I)???11/9OPT(I)?+?6/9 -- Sequential Vector Packing -- A Tighter Analysis of Set Cover Greedy Algorithm for Test Set -- A More Effective Linear Kernelization for Cluster Editing -- CR-precis: A Deterministic Summary Structure for Update Data Streams -- An Effective Refinement Algorithm Based on Swarm Intelligence for Graph Bipartitioning -- On the Complexity and Approximation of the Min-Sum and Min-Max Disjoint Paths Problems -- A Digital Watermarking Scheme Based on Singular Value Decomposition -- A New (t,n)??Threshold Scheme Based on Difference Equations -- Clique-Transversal Sets in Cubic Graphs -- On the L(h,k)-Labeling of Co-comparability Graphs -- An Approximation Algorithm for the General Mixed Packing and Covering Problem -- Extending the Hardness of RNA Secondary Structure Comparison -- On the On-Line Weighted k-Taxi Problem -- Model Futility and Dynamic Boundaries with Application in Banking Default Risk Modeling -- On the Minimum Risk-Sum Path Problem -- Constrained Cycle Covers in Halin Graphs -- Optimal Semi-online Algorithms for Scheduling with Machine Activation Cost -- A Fast Asymptotic Approximation Scheme for Bin Packing with Rejection -- Online Coupon Consumption Problem -- Application of Copula and Copula-CVaR in the Multivariate Portfolio Optimization -- Online Capacitated Interval Coloring -- Energy Efficient Heuristic Scheduling Algorithms for Multimedia Service -- Call Control and Routing in SONET Rings -- Fast Matching Method for DNA Sequences -- All-Pairs Ancestor Problems in Weighted Dags -- Streaming Algorithms for Data in Motion -- A Scheduling Problem with One Producer and the Bargaining Counterpart with Two Producers -- Phrase-Based Statistical Language Modeling from Bilingual Parallel Corpus -- Optimal Commodity Distribution for a Vehicle with Fixed Capacity Under Vendor Managed Inventory -- On-Line Bin Packing with Arbitrary Release Times -- On the Complexity of the Max-Edge-Coloring Problem with Its Variants -- Quantitative Analysis of Multi-hop Wireless Networks Using a Novel Paradigm -- Inverse Min-Max Spanning Tree Problem Under the Weighted Sum-Type Hamming Distance -- Robust Optimization Model for a Class of Uncertain Linear Programs -- An Efficient Algorithm for Solving the Container Loading Problem -- A Bijective Code for k-Trees with Linear Time Encoding and Decoding -- Market-Based Service Selection Framework in Grid Computing -- Informative Gene Selection and Tumor Classification by Null Space LDA for Microarray Data -- Heuristic Search for 2D NMR Alignment to Support Metabolite Identification -- A New Succinct Representation of RMQ-Information and Improvements in the Enhanced Suffix Array -- Lagrangian Relaxation and Cutting Planes for the Vertex Separator Problem -- Finding Pure Nash Equilibrium of Graphical Game Via Constraints Satisfaction Approach -- A New Load Balanced Routing Algorithm for Torus Networks -- Optimal Semi-online Scheduling Algorithms on a Small Number of Machines -- Lower Bounds on Edge Searching. |
| Record Nr. | UNISA-996465887503316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2007 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Combinatorics, Algorithms, Probabilistic and Experimental Methodologies : First International Symposium, ESCAPE 2007, Hangzhou, China, April 7-9, 2007, Revised Selected Papers / / edited by Bo Chen, Mike Paterson, Guochuan Zhang
| Combinatorics, Algorithms, Probabilistic and Experimental Methodologies : First International Symposium, ESCAPE 2007, Hangzhou, China, April 7-9, 2007, Revised Selected Papers / / edited by Bo Chen, Mike Paterson, Guochuan Zhang |
| Edizione | [1st ed. 2007.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2007 |
| Descrizione fisica | 1 online resource (XII, 530 p.) |
| Disciplina | 511.6 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Algorithms
Pattern recognition systems Computer simulation Data mining Bioinformatics Automated Pattern Recognition Computer Modelling Data Mining and Knowledge Discovery Computational and Systems Biology |
| ISBN | 3-540-74450-9 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | The Tight Bound of First Fit Decreasing Bin-Packing Algorithm Is FFD(I)???11/9OPT(I)?+?6/9 -- Sequential Vector Packing -- A Tighter Analysis of Set Cover Greedy Algorithm for Test Set -- A More Effective Linear Kernelization for Cluster Editing -- CR-precis: A Deterministic Summary Structure for Update Data Streams -- An Effective Refinement Algorithm Based on Swarm Intelligence for Graph Bipartitioning -- On the Complexity and Approximation of the Min-Sum and Min-Max Disjoint Paths Problems -- A Digital Watermarking Scheme Based on Singular Value Decomposition -- A New (t,n)??Threshold Scheme Based on Difference Equations -- Clique-Transversal Sets in Cubic Graphs -- On the L(h,k)-Labeling of Co-comparability Graphs -- An Approximation Algorithm for the General Mixed Packing and Covering Problem -- Extending the Hardness of RNA Secondary Structure Comparison -- On the On-Line Weighted k-Taxi Problem -- Model Futility and Dynamic Boundaries with Application in Banking Default Risk Modeling -- On the Minimum Risk-Sum Path Problem -- Constrained Cycle Covers in Halin Graphs -- Optimal Semi-online Algorithms for Scheduling with Machine Activation Cost -- A Fast Asymptotic Approximation Scheme for Bin Packing with Rejection -- Online Coupon Consumption Problem -- Application of Copula and Copula-CVaR in the Multivariate Portfolio Optimization -- Online Capacitated Interval Coloring -- Energy Efficient Heuristic Scheduling Algorithms for Multimedia Service -- Call Control and Routing in SONET Rings -- Fast Matching Method for DNA Sequences -- All-Pairs Ancestor Problems in Weighted Dags -- Streaming Algorithms for Data in Motion -- A Scheduling Problem with One Producer and the Bargaining Counterpart with Two Producers -- Phrase-Based Statistical Language Modeling from Bilingual Parallel Corpus -- Optimal Commodity Distribution for a Vehicle with Fixed Capacity Under Vendor Managed Inventory -- On-Line Bin Packing with Arbitrary Release Times -- On the Complexity of the Max-Edge-Coloring Problem with Its Variants -- Quantitative Analysis of Multi-hop Wireless Networks Using a Novel Paradigm -- Inverse Min-Max Spanning Tree Problem Under the Weighted Sum-Type Hamming Distance -- Robust Optimization Model for a Class of Uncertain Linear Programs -- An Efficient Algorithm for Solving the Container Loading Problem -- A Bijective Code for k-Trees with Linear Time Encoding and Decoding -- Market-Based Service Selection Framework in Grid Computing -- Informative Gene Selection and Tumor Classification by Null Space LDA for Microarray Data -- Heuristic Search for 2D NMR Alignment to Support Metabolite Identification -- A New Succinct Representation of RMQ-Information and Improvements in the Enhanced Suffix Array -- Lagrangian Relaxation and Cutting Planes for the Vertex Separator Problem -- Finding Pure Nash Equilibrium of Graphical Game Via Constraints Satisfaction Approach -- A New Load Balanced Routing Algorithm for Torus Networks -- Optimal Semi-online Scheduling Algorithms on a Small Number of Machines -- Lower Bounds on Edge Searching. |
| Record Nr. | UNINA-9910768172403321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2007 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Computing and Combinatorics [[electronic resource] ] : 19th International Conference, COCOON 2013, Hangzhou, China, June 21-23, 2013, Proceedings / / edited by Ding-Zhu Du, Guochuan Zhang
| Computing and Combinatorics [[electronic resource] ] : 19th International Conference, COCOON 2013, Hangzhou, China, June 21-23, 2013, Proceedings / / edited by Ding-Zhu Du, Guochuan Zhang |
| Edizione | [1st ed. 2013.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2013 |
| Descrizione fisica | 1 online resource (XVIII, 861 p. 220 illus.) |
| Disciplina | 511.6 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Algorithms
Computer science—Mathematics Discrete mathematics Computer networks Computer science Artificial intelligence Discrete Mathematics in Computer Science Computer Communication Networks Theory of Computation Computer Science Logic and Foundations of Programming Artificial Intelligence |
| ISBN | 3-642-38768-3 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | New bounds for balloon popping problems -- On the sequential price of anarchy of isolation games -- Social exchange networks with distant bargaining. |
| Record Nr. | UNISA-996466320703316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2013 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Computing and Combinatorics : 19th International Conference, COCOON 2013, Hangzhou, China, June 21-23, 2013, Proceedings / / edited by Ding-Zhu Du, Guochuan Zhang
| Computing and Combinatorics : 19th International Conference, COCOON 2013, Hangzhou, China, June 21-23, 2013, Proceedings / / edited by Ding-Zhu Du, Guochuan Zhang |
| Edizione | [1st ed. 2013.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2013 |
| Descrizione fisica | 1 online resource (XVIII, 861 p. 220 illus.) |
| Disciplina | 511.6 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Algorithms
Computer science—Mathematics Discrete mathematics Computer networks Computer science Artificial intelligence Discrete Mathematics in Computer Science Computer Communication Networks Theory of Computation Computer Science Logic and Foundations of Programming Artificial Intelligence |
| ISBN | 3-642-38768-3 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | New bounds for balloon popping problems -- On the sequential price of anarchy of isolation games -- Social exchange networks with distant bargaining. |
| Record Nr. | UNINA-9910481958703321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2013 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Frontiers of Algorithmics [[electronic resource] ] : International Joint Conference, IJTCS-FAW 2021, Beijing, China, August 16–19, 2021, Proceedings / / edited by Jing Chen, Minming Li, Guochuan Zhang
| Frontiers of Algorithmics [[electronic resource] ] : International Joint Conference, IJTCS-FAW 2021, Beijing, China, August 16–19, 2021, Proceedings / / edited by Jing Chen, Minming Li, Guochuan Zhang |
| Edizione | [1st ed. 2022.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2022 |
| Descrizione fisica | 1 online resource (102 pages) |
| Disciplina | 005.1 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science - Mathematics
Discrete mathematics Numerical analysis Data structures (Computer science) Information theory Computer engineering Computer networks Software engineering Algorithms Discrete Mathematics in Computer Science Numerical Analysis Data Structures and Information Theory Computer Engineering and Networks Software Engineering Design and Analysis of Algorithms |
| ISBN | 3-030-97099-X |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Insights from the Conscious Turing Machine (CTM) -- Speculative Smart Contracts -- Optimization from Structured Samples—An Effective Approach for Data-Driven Optimization -- Recent Developments in Property Testing of Boolean Functions -- AC0 Circuits, First-Order Logic, and Well-Structured graphs -- Model-Based Digital Engineering and Verification of Intelligent Systems -- Tight Online Algorithms for Unrelated Machine Load Balancing with Predictions -- Fast Sampling Constraint Satisfaction Solutions via the Lovász Local Lemma -- Pool Block Withholding Attack with Rational Miners -- Approximation Algorithms for the Directed Path Partition Problems -- Faster Algorithms for k-Subset Sum and variations -- Hardness and Algorithms for Electoral Manipulation under Media Influence -- Improved Approximation Algorithms for Multiprocessor Scheduling with Testing. |
| Record Nr. | UNISA-996464549203316 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2022 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Frontiers of Algorithmics : International Joint Conference, IJTCS-FAW 2021, Beijing, China, August 16–19, 2021, Proceedings / / edited by Jing Chen, Minming Li, Guochuan Zhang
| Frontiers of Algorithmics : International Joint Conference, IJTCS-FAW 2021, Beijing, China, August 16–19, 2021, Proceedings / / edited by Jing Chen, Minming Li, Guochuan Zhang |
| Edizione | [1st ed. 2022.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2022 |
| Descrizione fisica | 1 online resource (102 pages) |
| Disciplina |
005.1
004 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science - Mathematics
Discrete mathematics Numerical analysis Data structures (Computer science) Information theory Computer engineering Computer networks Software engineering Algorithms Discrete Mathematics in Computer Science Numerical Analysis Data Structures and Information Theory Computer Engineering and Networks Software Engineering Design and Analysis of Algorithms |
| ISBN | 3-030-97099-X |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Insights from the Conscious Turing Machine (CTM) -- Speculative Smart Contracts -- Optimization from Structured Samples—An Effective Approach for Data-Driven Optimization -- Recent Developments in Property Testing of Boolean Functions -- AC0 Circuits, First-Order Logic, and Well-Structured graphs -- Model-Based Digital Engineering and Verification of Intelligent Systems -- Tight Online Algorithms for Unrelated Machine Load Balancing with Predictions -- Fast Sampling Constraint Satisfaction Solutions via the Lovász Local Lemma -- Pool Block Withholding Attack with Rational Miners -- Approximation Algorithms for the Directed Path Partition Problems -- Faster Algorithms for k-Subset Sum and variations -- Hardness and Algorithms for Electoral Manipulation under Media Influence -- Improved Approximation Algorithms for Multiprocessor Scheduling with Testing. |
| Record Nr. | UNINA-9910551843303321 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2022 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||