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.
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques [[electronic resource] ] : 12th International Workshop, APPROX 2009, and 13th International Workshop, RANDOM 2009, Berkeley, CA, USA, August, 21-23, 2009, Proceedings / / edited by Irit Dinur, Klaus Jansen, Seffi Naor, José Rolim
| Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques [[electronic resource] ] : 12th International Workshop, APPROX 2009, and 13th International Workshop, RANDOM 2009, Berkeley, CA, USA, August, 21-23, 2009, Proceedings / / edited by Irit Dinur, Klaus Jansen, Seffi Naor, José Rolim |
| Edizione | [1st ed. 2009.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2009 |
| Descrizione fisica | 1 online resource (XII, 742 p. 41 illus.) |
| Disciplina | 005.11 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer programming
Algorithms Computer science—Mathematics Discrete mathematics Numerical analysis Mathematical statistics Programming Techniques Discrete Mathematics in Computer Science Numerical Analysis Symbolic and Algebraic Manipulation Probability and Statistics in Computer Science |
| ISBN | 3-642-03685-6 |
| Classificazione |
DAT 517f
DAT 537f MAT 410f MAT 913f SS 4800 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Contributed Talks of APPROX -- Approximation Algorithms and Hardness Results for Packing Element-Disjoint Steiner Trees in Planar Graphs -- Adaptive Sampling for k-Means Clustering -- Approximations for Aligned Coloring and Spillage Minimization in Interval and Chordal Graphs -- Unsplittable Flow in Paths and Trees and Column-Restricted Packing Integer Programs -- Truthful Mechanisms via Greedy Iterative Packing -- Resource Minimization Job Scheduling -- The Power of Preemption on Unrelated Machines and Applications to Scheduling Orders -- New Hardness Results for Diophantine Approximation -- PASS Approximation -- Optimal Sherali-Adams Gaps from Pairwise Independence -- An Approximation Scheme for Terrain Guarding -- Scheduling with Outliers -- Improved Inapproximability Results for Maximum k-Colorable Subgraph -- Improved Absolute Approximation Ratios for Two-Dimensional Packing Problems -- On the Optimality of Gluing over Scales -- On Hardness of Pricing Items for Single-Minded Bidders -- Real-Time Message Routing and Scheduling -- Approximating Some Network Design Problems with Node Costs -- Submodular Maximization over Multiple Matroids via Generalized Exchange Properties -- Robust Algorithms for on Minor-Free Graphs Based on the Sherali-Adams Hierarchy -- Minimizing Average Shortest Path Distances via Shortcut Edge Addition -- Approximating Node-Connectivity Augmentation Problems -- A 7/9 - Approximation Algorithm for the Maximum Traveling Salesman Problem -- Approximation Algorithms for Domatic Partitions of Unit Disk Graphs -- On the Complexity of the Asymmetric VPN Problem -- Contributed Talks of RANDOM -- Deterministic Approximation Algorithms for the Nearest Codeword Problem -- Strong Parallel Repetition Theorem for Free Projection Games -- Random Low Degree Polynomials are Hard to Approximate -- Composition of Semi-LTCs by Two-Wise Tensor Products -- On the Security of Goldreich’s One-Way Function -- Random Tensors and Planted Cliques -- Sampling s-Concave Functions: The Limit of Convexity Based Isoperimetry -- Average-Case Analyses of Vickrey Costs -- A Hypergraph Dictatorship Test with Perfect Completeness -- Extractors Using Hardness Amplification -- How Well Do Random Walks Parallelize? -- An Analysis of Random-Walk Cuckoo Hashing -- Hierarchy Theorems for Property Testing -- Algorithmic Aspects of Property Testing in the Dense Graphs Model -- Succinct Representation of Codes with Applications to Testing -- Efficient Quantum Tensor Product Expanders and k-Designs -- Hellinger Strikes Back: A Note on the Multi-party Information Complexity of AND -- Pseudorandom Generators and Typically-Correct Derandomization -- Baum’s Algorithm Learns Intersections of Halfspaces with Respect to Log-Concave Distributions -- Tolerant Linearity Testing and Locally Testable Codes -- Pseudorandom Bit Generators That Fool Modular Sums -- The Glauber Dynamics for Colourings of Bounded Degree Trees -- Testing ±1-weight halfspace -- Small-Bias Spaces for Group Products -- Small Clique Detection and Approximate Nash Equilibria -- Testing Computability by Width Two OBDDs -- Improved Polynomial Identity Testing for Read-Once Formulas -- Smooth Analysis of the Condition Number and the Least Singular Value. |
| Record Nr. | UNISA-996465733103316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2009 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques : 12th International Workshop, APPROX 2009, and 13th International Workshop, RANDOM 2009, Berkeley, CA, USA, August, 21-23, 2009, Proceedings / / edited by Irit Dinur, Klaus Jansen, Seffi Naor, José Rolim
| Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques : 12th International Workshop, APPROX 2009, and 13th International Workshop, RANDOM 2009, Berkeley, CA, USA, August, 21-23, 2009, Proceedings / / edited by Irit Dinur, Klaus Jansen, Seffi Naor, José Rolim |
| Edizione | [1st ed. 2009.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2009 |
| Descrizione fisica | 1 online resource (XII, 742 p. 41 illus.) |
| Disciplina | 005.11 |
| Altri autori (Persone) | DinurIrit |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer programming
Algorithms Computer science - Mathematics Discrete mathematics Numerical analysis Mathematical statistics Programming Techniques Discrete Mathematics in Computer Science Numerical Analysis Symbolic and Algebraic Manipulation Probability and Statistics in Computer Science |
| ISBN | 3-642-03685-6 |
| Classificazione |
DAT 517f
DAT 537f MAT 410f MAT 913f SS 4800 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Contributed Talks of APPROX -- Approximation Algorithms and Hardness Results for Packing Element-Disjoint Steiner Trees in Planar Graphs -- Adaptive Sampling for k-Means Clustering -- Approximations for Aligned Coloring and Spillage Minimization in Interval and Chordal Graphs -- Unsplittable Flow in Paths and Trees and Column-Restricted Packing Integer Programs -- Truthful Mechanisms via Greedy Iterative Packing -- Resource Minimization Job Scheduling -- The Power of Preemption on Unrelated Machines and Applications to Scheduling Orders -- New Hardness Results for Diophantine Approximation -- PASS Approximation -- Optimal Sherali-Adams Gaps from Pairwise Independence -- An Approximation Scheme for Terrain Guarding -- Scheduling with Outliers -- Improved Inapproximability Results for Maximum k-Colorable Subgraph -- Improved Absolute Approximation Ratios for Two-Dimensional Packing Problems -- On the Optimality of Gluing over Scales -- On Hardness of Pricing Items for Single-Minded Bidders -- Real-Time Message Routing and Scheduling -- Approximating Some Network Design Problems with Node Costs -- Submodular Maximization over Multiple Matroids via Generalized Exchange Properties -- Robust Algorithms for on Minor-Free Graphs Based on the Sherali-Adams Hierarchy -- Minimizing Average Shortest Path Distances via Shortcut Edge Addition -- Approximating Node-Connectivity Augmentation Problems -- A 7/9 - Approximation Algorithm for the Maximum Traveling Salesman Problem -- Approximation Algorithms for Domatic Partitions of Unit Disk Graphs -- On the Complexity of the Asymmetric VPN Problem -- Contributed Talks of RANDOM -- Deterministic Approximation Algorithms for the Nearest Codeword Problem -- Strong Parallel Repetition Theorem for Free Projection Games -- Random Low Degree Polynomials are Hard to Approximate -- Composition of Semi-LTCs by Two-Wise Tensor Products -- On the Security of Goldreich’s One-Way Function -- Random Tensors and Planted Cliques -- Sampling s-Concave Functions: The Limit of Convexity Based Isoperimetry -- Average-Case Analyses of Vickrey Costs -- A Hypergraph Dictatorship Test with Perfect Completeness -- Extractors Using Hardness Amplification -- How Well Do Random Walks Parallelize? -- An Analysis of Random-Walk Cuckoo Hashing -- Hierarchy Theorems for Property Testing -- Algorithmic Aspects of Property Testing in the Dense Graphs Model -- Succinct Representation of Codes with Applications to Testing -- Efficient Quantum Tensor Product Expanders and k-Designs -- Hellinger Strikes Back: A Note on the Multi-party Information Complexity of AND -- Pseudorandom Generators and Typically-Correct Derandomization -- Baum’s Algorithm Learns Intersections of Halfspaces with Respect to Log-Concave Distributions -- Tolerant Linearity Testing and Locally Testable Codes -- Pseudorandom Bit Generators That Fool Modular Sums -- The Glauber Dynamics for Colourings of Bounded Degree Trees -- Testing ±1-weight halfspace -- Small-Bias Spaces for Group Products -- Small Clique Detection and Approximate Nash Equilibria -- Testing Computability by Width Two OBDDs -- Improved Polynomial Identity Testing for Read-Once Formulas -- Smooth Analysis of the Condition Number and the Least Singular Value. |
| Record Nr. | UNINA-9910484414603321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2009 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
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. | UNISA-996465302503316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2010 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Evolutionary Computation in Combinatorial Optimization : 10th European Conference, EvoCOP 2010, Istanbul, Turkey, April 7-9, 2010, Proceedings / / edited by Peter I. Cowling, Peter Merz
| Evolutionary Computation in Combinatorial Optimization : 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 |
| Altri autori (Persone) |
CowlingPeter I (Peter Ivan)
MerzPeter, Dr.-Ing. |
| 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 | ||
| ||