LEADER 01317nas 2200433 c 450 001 9910671587503321 005 20201005192604.0 024 8 $aHein-cfr/years_title_0005 035 $a(CKB)3390000000017734 035 $a(DE-599)ZDB2225049-9 035 $a(OCoLC)644274489 035 $a(DE-101)978790227 035 $a(EXLCZ)993390000000017734 100 $a20060303a19389999 |y | 101 0 $aeng 135 $aur||||||||||| 181 $ctxt$2rdacontent 182 $cc$2rdamedia 183 $acr$2rdacarrier 200 00$aCode of federal regulations$eCFR$hTitle 5$iAdministrative personnel$fNational Archives and Records Administration 210 31$aWashington, DC$aBuffalo, NY$cHeinOnline$d1938- 215 $aOnline-Ressource 300 $aGesehen am 05.10.2018 517 1 $aCode of federal regulations / 5 517 3 $aCFR 517 3 $aAdministrative personnel 531 $aCODE OF FEDERAL REGULATIONS - TITLE 5 608 $aZeitschrift$2gnd-content 676 $a310 676 $a650 686 $aINTRECHT$qDE-1a$2fid 712 02$aUSA$bNational Archives and Records Administration$4isb 801 0$b0001 801 1$bDE-101 801 2$b9999 906 $aJOURNAL 912 $a9910671587503321 996 $aCode of federal regulations$93042827 997 $aUNINA LEADER 06172nam 22008055 450 001 9910483466103321 005 20251226202559.0 010 $a3-642-02011-9 024 7 $a10.1007/978-3-642-02011-7 035 $a(CKB)1000000000753971 035 $a(SSID)ssj0000317598 035 $a(PQKBManifestationID)11240612 035 $a(PQKBTitleCode)TC0000317598 035 $a(PQKBWorkID)10293990 035 $a(PQKB)10372122 035 $a(DE-He213)978-3-642-02011-7 035 $a(MiAaPQ)EBC3064247 035 $a(PPN)136306454 035 $a(BIP)26969760 035 $a(EXLCZ)991000000000753971 100 $a20100301d2009 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aExperimental Algorithms $e8th International Symposium SEA 2009, Dortmund, Germany, June 4-6, 2009, Proceedings /$fedited by Jan Vahrenhold 205 $a1st ed. 2009. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2009. 215 $a1 online resource (X, 293 p.) 225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v5526 300 $aBibliographic Level Mode of Issuance: Monograph 311 08$a3-642-02010-0 320 $aIncludes bibliographical references and index. 327 $aParallelism in Current and Future Processors ? Challenges and Support for Designing Optimal Algorithms -- From Streaming B-Trees to Tokutek: How a Theoretician Learned to be VP of Engineering -- Experimental Comparisons of Derivative Free Optimization Algorithms -- On Computational Models for Flash Memory Devices -- Competitive Buffer Management with Stochastic Packet Arrivals -- Fast and Accurate Bounds on Linear Programs -- Batch Dynamic Single-Source Shortest-Path Algorithms: An Experimental Study -- Rotated-Box Trees: A Lightweight c-Oriented Bounding-Volume Hierarchy -- psort, Yet Another Fast Stable Sorting Software -- A Heuristic for Fair Correlation-Aware Resource Placement -- Measuring the Similarity of Geometric Graphs -- A Heuristic Strong Connectivity Algorithm for Large Graphs -- Pareto Paths with SHARC -- An Application of Self-organizing Data Structures to Compression -- Scheduling Additional Trains on Dense Corridors -- Broadword Computing and Fibonacci Code Speed Up Compressed Suffix Arrays -- Speed-Up Techniques for the Selfish Step Algorithm in Network Congestion Games -- Experimental Study of Non-oblivious Greedy and Randomized Rounding Algorithms for Hypergraph b-Matching -- Empirical Evaluation of Graph Partitioning Using Spectral Embeddings and Flow -- Univariate Algebraic Kernel and Application to Arrangements -- Fast Algorithm for Graph Isomorphism Testing -- Algorithms and Experiments for Clique Relaxations?Finding Maximum s-Plexes -- A Design-for-Yield Algorithm to Assess and Improve the Structural and Energetic Robustness of Proteins and Drugs -- Multi-level Algorithms for Modularity Clustering -- Bulk-Insertion Sort: Towards Composite Measures of Presortedness -- Computing Elevation Maxima by Searching the Gauss Sphere. 330 $aThis volume contains the papers presented at the 8th International Symposium on Experimental Algorithms (SEA 2009).The symposium was held at the Te- nische Universit¨ at Dortmund, Germany, during June 4-6, 2009. The main theme of the SEA series is the role of experimentation and of algorithm engineering techniques in the design and evaluation of algorithms and data structures. Contributions are supported by experimental evaluation, methodological issues in the design and interpretation of experiments, the use of (meta-)heuristics, or application-driven case studies that deepen the und- standing of a problem's complexity. For each symposium, papers are solicited from all areas of algorithmic engineering research. Previous meetings, under the name of "Workshop on Experimental Al- rithms" (WEA), were held in Riga (Latvia, 2001), Ascona (Switzerland, 2003), Angra dos Reis (Brazil, 2004), Santorini (Greece, 2005), Menorca Island (Spain, 2006), Rome (Italy, 2007), and Provincetown (USA, 2008). The ProgramCommittee ofSEA 2009received64 submissions.Eachsubm- sion was reviewed by at least three ProgramCommittee members and evaluated on its quality,originality,and relevance to the symposium. Overall,the Program Committee wrote249 reviews with the help of almost 100 trusted external ref- ees. The Committee selected 23 papers, leading to an acceptance rate of 35.9%. The decision process was made electronically using the EasyChair conference management system. In additionto the accepted contributions,this volumealso containsabstracts ofthe invitedtalks givenby Heinz Bast(Intel), MichaelA. Bender (Stony Brook ^ University and Tokutek, Inc.), and Marc Schoenauer (INRIA Saclay - Ile-de- France). 410 0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v5526 606 $aComputer science$xMathematics 606 $aArtificial intelligence$xData processing 606 $aMathematical models 606 $aAlgorithms 606 $aData structures (Computer science) 606 $aInformation theory 606 $aMathematics of Computing 606 $aData Science 606 $aMathematical Modeling and Industrial Mathematics 606 $aAlgorithms 606 $aData Structures and Information Theory 615 0$aComputer science$xMathematics. 615 0$aArtificial intelligence$xData processing. 615 0$aMathematical models. 615 0$aAlgorithms. 615 0$aData structures (Computer science). 615 0$aInformation theory. 615 14$aMathematics of Computing. 615 24$aData Science. 615 24$aMathematical Modeling and Industrial Mathematics. 615 24$aAlgorithms. 615 24$aData Structures and Information Theory. 676 $a005.0151 686 $aDAT 530f$2stub 686 $aSS 4800$2rvk 701 $aVahrenhold$b Jan$01752460 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910483466103321 996 $aExperimental algorithms$94187778 997 $aUNINA