Experimental Algorithms : 5th International Workshop, WEA 2006, Cala Galdana, Menorca, Spain, May 24-27, 2006, Proceedings / edited by Carme Àlvarez, Maria Serna
(Theoretical Computer Science and General Issues. ISSN:25122029 ; 4007)
データ種別 | 電子ブック |
---|---|
版 | 1st ed. 2006. |
出版者 | (Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer) |
出版年 | 2006 |
大きさ | XII, 332 p : online resource |
著者標目 | Àlvarez, Carme editor Serna, Maria editor SpringerLink (Online service) |
書誌詳細を非表示
一般注記 | Session 1 -- Algorithms for Wireless Sensor Networks: Design, Analysis and Experimental Evaluation -- Numerical Estimation of the Impact of Interferences on the Localization Problem in Sensor Networks -- Session 2 -- An Efficient Heuristic for the Ring Star Problem -- An Incremental Model for Combinatorial Maximization Problems -- Workload Balancing in Multi-stage Production Processes -- Session 3 -- Fault Cryptanalysis and the Shrinking Generator -- Some Advances in the Theory of Voting Systems Based on Experimental Algorithms -- Session 4 -- Practical Construction of k-Nearest Neighbor Graphs in Metric Spaces -- Fast and Simple Approximation of the Diameter and Radius of a Graph -- Session 5 -- Lists on Lists: A Framework for Self-organizing Lists in Environments with Locality of Reference -- Lists Revisited: Cache Conscious STL Lists -- Engineering the LOUDS Succinct Tree Representation -- Session 6 -- Faster Adaptive Set Intersections for Text Searching -- Compressed Dictionaries: Space Measures, Data Sets, and Experiments -- Efficient Bit-Parallel Algorithms for (?,?)-Matching -- Session 7 -- Tiny Experiments for Algorithms and Life -- Evaluation of Online Strategies for Reordering Buffers -- Session 8 -- Scheduling Unrelated Parallel Machines Computational Results -- Implementation of Approximation Algorithms for the Max-Min Resource Sharing Problem -- Column Generation Based Heuristic for a Helicopter Routing Problem -- Session 9 -- Kernels for the Vertex Cover Problem on the Preferred Attachment Model -- Practical Partitioning-Based Methods for the Steiner Problem -- Session 10 -- Algorithmic and Complexity Results for Decompositions of Biological Networks into Monotone Subsystems -- A Maximum Profit Coverage Algorithm with Application to Small Molecules Cluster Identification -- Session 11 -- Algorithmic Challenges in Web Search Engines -- On the Least Cost for Proximity Searching in Metric Spaces -- Session 12 -- Updating Directed Minimum Cost Spanning Trees -- Experiments on Exact Crossing Minimization Using Column Generation -- Goal Directed Shortest Path Queries Using Precomputed Cluster Distances HTTP:URL=https://doi.org/10.1007/11764298 |
---|---|
件 名 | LCSH:Artificial intelligence -- Data processing
全ての件名で検索
LCSH:Algorithms LCSH:Computer science -- Mathematics 全ての件名で検索 LCSH:Discrete mathematics LCSH:Numerical analysis LCSH:Computer graphics FREE:Data Science FREE:Algorithms FREE:Discrete Mathematics in Computer Science FREE:Numerical Analysis FREE:Computer Graphics |
分 類 | LCC:Q336 DC23:005.7 |
書誌ID | EB00003420 |
ISBN | 9783540345985 |
類似資料
この資料の利用統計
このページへのアクセス回数:10回
※2019年3月27日以降
全貸出数:0回
(1年以内の貸出:0回)
※2019年3月27日以降