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.
Algorithm Engineering and Experimentation [[electronic resource] ] : Third International Workshop, ALENEX 2001, Washington, DC, USA, January 5-6, 2001. Revised Papers / / edited by Adam L. Buchsbaum, Jack Snoeyink
| Algorithm Engineering and Experimentation [[electronic resource] ] : Third International Workshop, ALENEX 2001, Washington, DC, USA, January 5-6, 2001. Revised Papers / / edited by Adam L. Buchsbaum, Jack Snoeyink |
| Edizione | [1st ed. 2001.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2001 |
| Descrizione fisica | 1 online resource (VIII, 236 p.) |
| Disciplina | 005.1 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computer programming
Database management Algorithms Data structures (Computer science) Computer graphics Numerical analysis Programming Techniques Database Management Algorithm Analysis and Problem Complexity Data Structures Computer Graphics Numeric Computing |
| ISBN | 3-540-44808-X |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | ALENEX’01 -- Solving a “Hard” Problem to Approximate an “Easy” One: Heuristics for Maximum Matchings and Maximum Traveling Salesman Problems -- CNOP - A Package for Constrained Network Optimization -- The Asymmetric Traveling Salesman Problem: Algorithms, Instance Generators, and Tests -- Network Tomography through End-to-End Measurements -- Experimental Results on Statistical Approaches to Page Replacement Policies -- Estimating Resemblance of MIDI Documents -- Experiments on Adaptive Set Intersections for Text Retrieval Systems -- PVD: A Stable Implementation for Computing Voronoi Diagrams of Polygonal Pockets -- Hierarchical Clustering of Trees: Algorithms and Experiments -- Travel Planning with Self-Made Maps -- New Algorithmic Challenges Arising in Measurement-Driven Networking Research -- A Probabilistic Spell for the Curse of Dimensionality -- Experimental Evaluation of the Height of a Random Set of Points in a d-Dimensional Cube -- An Empirical Study of a New Approach to Nearest Neighbor Searching -- Spectral Analysis for Data Mining -- Trade Off Between Compression and Search Times in Compact Suffix Array -- Implementation of a PTAS for Scheduling with Release Dates -- Biased Skip Lists for Highly Skewed Access Patterns. |
| Record Nr. | UNISA-996465876603316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2001 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Algorithm Engineering and Experimentation : Third International Workshop, ALENEX 2001, Washington, DC, USA, January 5-6, 2001. Revised Papers / / edited by Adam L. Buchsbaum, Jack Snoeyink
| Algorithm Engineering and Experimentation : Third International Workshop, ALENEX 2001, Washington, DC, USA, January 5-6, 2001. Revised Papers / / edited by Adam L. Buchsbaum, Jack Snoeyink |
| Edizione | [1st ed. 2001.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2001 |
| Descrizione fisica | 1 online resource (VIII, 236 p.) |
| Disciplina | 005.1 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computer programming
Database management Algorithms Data structures (Computer science) Computer graphics Numerical analysis Programming Techniques Database Management Algorithm Analysis and Problem Complexity Data Structures Computer Graphics Numeric Computing |
| ISBN | 3-540-44808-X |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | ALENEX’01 -- Solving a “Hard” Problem to Approximate an “Easy” One: Heuristics for Maximum Matchings and Maximum Traveling Salesman Problems -- CNOP - A Package for Constrained Network Optimization -- The Asymmetric Traveling Salesman Problem: Algorithms, Instance Generators, and Tests -- Network Tomography through End-to-End Measurements -- Experimental Results on Statistical Approaches to Page Replacement Policies -- Estimating Resemblance of MIDI Documents -- Experiments on Adaptive Set Intersections for Text Retrieval Systems -- PVD: A Stable Implementation for Computing Voronoi Diagrams of Polygonal Pockets -- Hierarchical Clustering of Trees: Algorithms and Experiments -- Travel Planning with Self-Made Maps -- New Algorithmic Challenges Arising in Measurement-Driven Networking Research -- A Probabilistic Spell for the Curse of Dimensionality -- Experimental Evaluation of the Height of a Random Set of Points in a d-Dimensional Cube -- An Empirical Study of a New Approach to Nearest Neighbor Searching -- Spectral Analysis for Data Mining -- Trade Off Between Compression and Search Times in Compact Suffix Array -- Implementation of a PTAS for Scheduling with Release Dates -- Biased Skip Lists for Highly Skewed Access Patterns. |
| Record Nr. | UNINA-9910767575803321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2001 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Frontiers in Algorithmics and Algorithmic Aspects in Information and Management [[electronic resource] ] : Joint International Conference, FAW-AAIM 2012, Beijing, China, May 14-16, 2012, Proceedings / / edited by Jack Snoeyink, Pinyan Lu, Kaile Su, Lusheng Wang
| Frontiers in Algorithmics and Algorithmic Aspects in Information and Management [[electronic resource] ] : Joint International Conference, FAW-AAIM 2012, Beijing, China, May 14-16, 2012, Proceedings / / edited by Jack Snoeyink, Pinyan Lu, Kaile Su, Lusheng Wang |
| Edizione | [1st ed. 2012.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2012 |
| Descrizione fisica | 1 online resource (XVII, 370 p. 77 illus.) |
| Disciplina | 005.1 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Algorithms
Computer science—Mathematics Discrete mathematics Computer science Electronic data processing—Management Artificial intelligence—Data processing Discrete Mathematics in Computer Science Mathematics of Computing Theory of Computation IT Operations Data Science |
| ISBN | 3-642-29700-5 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto |
Optimal Binary Representation of Mosaic Floorplans and Baxter Permutations / Bryan He -- Succinct Strictly Convex Greedy Drawing of 3-Connected Plane Graphs / Jiun-Jie Wang and Xin He -- Weighted Inverse Minimum Cut Problem under the Sum-Type Hamming Distance / Longcheng Liu, Yong Chen, Biao Wu and Enyu Yao -- Voronoi Diagram with Visual Restriction / Chenglin Fan, Jun Luo, Wencheng Wang and Binhai Zhu -- Minimization of the Maximum Distance between the Two Guards Patrolling a Polygonal Region / Xuehou Tan and Bo Jiang -- On Covering Points with Minimum Turns / Minghui Jiang -- On Envy-Free Pareto Efficient Pricing / Xia Hua -- Online Pricing for Multi-type of Items / Yong Zhang, Francis Y. L. Chin and Hing-Fung Ting -- Algorithms with Limited Number of Preemptions for Scheduling on Parallel Machines / Yiwei Jiang, Zewei Weng and Jueliang Hu -- Computing Maximum Non-crossing Matching in Convex Bipartite Graphs / Danny Z. Chen, Xiaomin Liu and Haitao Wang -- Algorithms for Bandwidth Consecutive Multicolorings of Graphs / (Extended Abstract) / Kazuhide Nishikawa, Takao Nishizeki and Xiao Zhou.
Independent Domination on Tree Convex Bipartite Graphs / Yu Song, Tian Liu and Ke Xu -- On-Line Scheduling of Parallel Jobs in Heterogeneous Multiple Clusters / Deshi Ye and Lili Mei -- On Multiprocessor Temperature-Aware Scheduling Problems / Evripidis Bampis, Dimitrios Letsios, Giorgio Lucarelli, Evangelos Markakis and Ioannis Milis -- Online Minimum Makespan Scheduling with a Buffer / Yan Lan, Xin Chen, Ning Ding, György Dósa and Xin Han -- A Dense Hierarchy of Sublinear Time Approximation Schemes for Bin Packing / Richard Beigel and Bin Fu -- Multivariate Polynomial Integration and Differentiation Are Polynomial Time Inapproximable Unless P=NP / Bin Fu -- Some Remarks on the Incompressibility of Width-Parameterized SAT Instances / Bangsheng Tang -- Kernels for Packing and Covering Problems / (Extended Abstract) / Jianer Chen, Henning Fernau, Peter Shaw, Jianxin Wang and Zhibiao Yang -- The Worst-Case Upper Bound for Exact 3-Satisfiability with the Number of Clauses as the Parameter / Junping Zhou and Minghao Yin -- Fixed-Parameter Tractability of almost CSP Problem with Decisive Relations / Chihao Zhang and Hongyang Zhang -- On Editing Graphs into 2-Club Clusters / Hong Liu, Peng Zhang and Daming Zhu. Solving Generalized Optimization Problems Subject to SMT Constraints / Feifei Ma, Jun Yan and Jian Zhang -- Solving Difficult SAT Problems by Using OBDDs and Greedy Clique Decomposition / Yanyan Xu, Wei Chen, Kaile Su and Wenhui Zhang -- Zero-Sum Flow Numbers of Regular Graphs / Tao-Ming Wang and Shih-Wei Hu -- More Efficient Parallel Integer Sorting / Yijie Han and Xin He -- Fast Relative Lempel-Ziv Self-index for Similar Sequences / Huy Hoang Do, Jesper Jansson, Kunihiko Sadakane and Wing-Kin Sung -- A Comparison of Performance Measures via Online Search / Joan Boyar, Kim S. Larsen and Abyayananda Maiti -- Online Exploration of All Vertices in a Simple Polygon / Yuya Higashikawa and Naoki Katoh -- In-Place Algorithms for Computing a Largest Clique in Geometric Intersection Graphs / Minati De, Subhas C. Nandy and Sasanka Roy -- The Black-and-White Coloring Problem on Distance-Hereditary Graphs and Strongly Chordal Graphs / Ton Kloks, Sheung-Hung Poon, Feng-Ren Tsai and Yue-Li Wang -- An Improved Approximation Algorithm for the Bandpass Problem / Weitian Tong, Randy Goebel, Wei Ding and Guohui Lin -- Partial Degree Bounded Edge Packing Problem / Peng Zhang -- Erratum: The Approximability of the Exemplar Breakpoint Distance Problem / Zhixiang Chen, Bin Fu and Binhai Zhu. |
| Record Nr. | UNISA-996465995203316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2012 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Proceedings of the twentieth annual Symposium on Computational Geometry
| Proceedings of the twentieth annual Symposium on Computational Geometry |
| Pubbl/distr/stampa | [Place of publication not identified], : ACM, 2004 |
| Descrizione fisica | 1 online resource (460 pages) |
| Collana | ACM Conferences |
| Soggetto topico |
Mathematics
Physical Sciences & Mathematics Geometry |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Altri titoli varianti | SoCG '04 annual ACM Symposium on Computational Geometry 2004, Brooklyn, NY, USA - June 08 - 11, 2004 |
| Record Nr. | UNINA-9910375823003321 |
| [Place of publication not identified], : ACM, 2004 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||