000 04456nam a22006015i 4500
001 978-3-540-34598-5
003 DE-He213
005 20240730192642.0
007 cr nn 008mamaa
008 100301s2006 gw | s |||| 0|eng d
020 _a9783540345985
_9978-3-540-34598-5
024 7 _a10.1007/11764298
_2doi
050 4 _aQ336
072 7 _aUN
_2bicssc
072 7 _aCOM021000
_2bisacsh
072 7 _aUN
_2thema
082 0 4 _a005.7
_223
245 1 0 _aExperimental Algorithms
_h[electronic resource] :
_b5th International Workshop, WEA 2006, Cala Galdana, Menorca, Spain, May 24-27, 2006, Proceedings /
_cedited by Carme Àlvarez, Maria Serna.
250 _a1st ed. 2006.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c2006.
300 _aXII, 332 p.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v4007
505 0 _aSession 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.
650 0 _aArtificial intelligence
_xData processing.
_921787
650 0 _aAlgorithms.
_93390
650 0 _aComputer science
_xMathematics.
_93866
650 0 _aDiscrete mathematics.
_912873
650 0 _aNumerical analysis.
_94603
650 0 _aComputer graphics.
_94088
650 1 4 _aData Science.
_934092
650 2 4 _aAlgorithms.
_93390
650 2 4 _aDiscrete Mathematics in Computer Science.
_931837
650 2 4 _aNumerical Analysis.
_94603
650 2 4 _aComputer Graphics.
_94088
700 1 _aÀlvarez, Carme.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9150773
700 1 _aSerna, Maria.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9150774
710 2 _aSpringerLink (Online service)
_9150775
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783540345978
776 0 8 _iPrinted edition:
_z9783540824817
830 0 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v4007
_9150776
856 4 0 _uhttps://doi.org/10.1007/11764298
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
942 _cELN
999 _c94362
_d94362