000 05580nam a22006255i 4500
001 978-3-540-68552-4
003 DE-He213
005 20240730181840.0
007 cr nn 008mamaa
008 100301s2008 gw | s |||| 0|eng d
020 _a9783540685524
_9978-3-540-68552-4
024 7 _a10.1007/978-3-540-68552-4
_2doi
050 4 _aQA76.758
072 7 _aUMZ
_2bicssc
072 7 _aCOM051230
_2bisacsh
072 7 _aUMZ
_2thema
082 0 4 _a005.1
_223
245 1 0 _aExperimental Algorithms
_h[electronic resource] :
_b7th International Workshop, WEA 2008 Provincetown, MA, USA, May 30 - June 1, 2008 Proceedings /
_cedited by Catherine C. McGeoch.
250 _a1st ed. 2008.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c2008.
300 _aX, 363 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 ;
_v5038
505 0 _aReducing Splaying by Taking Advantage of Working Sets -- Engineering Burstsort: Towards Fast In-Place String Sorting -- Comparing Integer Data Structures for 32 and 64 Bit Keys -- A New Graph-Theoretical Model for k-Dimensional Guillotine-Cutting Problems -- Layer-Free Upward Crossing Minimization -- On the Efficiency of a Local Iterative Algorithm to Compute Delaunay Realizations -- Computing Branch Decomposition of Large Planar Graphs -- Experimental Evaluation of an Exact Algorithm for the Orthogonal Art Gallery Problem -- Computing Multiple Watchman Routes -- Engineering Parallel In-Place Random Generation of Integer Permutations -- Parallel Partition Revisited -- Broadword Implementation of Rank/Select Queries -- Efficient Implementations of Heuristics for Routing and Wavelength Assignment -- Myopic Distributed Protocols for Singleton and Independent-Resource Congestion Games -- When to Reap and When to Sow - Lowering Peak Usage with Realistic Batteries -- Characterizing the Performance of Flash Memory Storage Devices and Its Impact on Algorithm Design -- Fast Local Search for the Maximum Independent Set Problem -- Optimal University Course Timetables and the Partial Transversal Polytope -- A Basic Toolbox for Constrained Quadratic 0/1 Optimization -- Empirical Investigation of Simplified Step-Size Control in Metaheuristics with a View to Theory -- Reconstructing Phylogenetic Networks with One Recombination -- Exact Algorithms for Cluster Editing: Evaluation and Experiments -- Combining Hierarchical and Goal-Directed Speed-Up Techniques for Dijkstra's Algorithm -- Contraction Hierarchies: Faster and Simpler Hierarchical Routing in Road Networks -- Bidirectional A ??? Search for Time-Dependent Fast Paths -- Multi-criteria Shortest Paths in Time-Dependent Train Networks.
520 _aThe Workshop on Experimental Algorithms, WEA, is intended to be an int- national forum for research on the experimental evaluation and engineering of algorithms, as well as in various aspects of computational optimization and its applications. The emphasis of the workshop is the use of experimental me- ods to guide the design, analysis, implementation, and evaluation of algorithms, heuristics, and optimization programs. WEA 2008 was held at the Provincetown Inn, Provincetown, MA, USA, on May 30 - June 1, 2008. This was the seventh workshop of the series, after Rome (2007),Menorca(2006),Santorini(2005),RiodeJaniero(2004),Asconia(2003), and Riga (2001). This volume contains all contributed papers accepted for presentation at the workshop. The 26 contributed papers were selected by the Program Committee onthebasisofatleastthreerefereereports,somecontributedbytrustedexternal referees. In addition to the 26 contributed papers, the program contained two invited talks. Camil Demetrescu, of the University of Rome "La Sapienza," spoke on "Visualization in Algorithm Engineering." David S. Johnson of AT & T Labs - Research, gave a talk on "Bin Packing: From Theory to Experiment and Back Again." We would like to thank the authors who responded to the call for papers, our invited speakers, the members of the ProgramCommittee, the external referees, and the Organizing Committee members for making this workshop possible.
650 0 _aSoftware engineering.
_94138
650 0 _aComputer programming.
_94169
650 0 _aNumerical analysis.
_94603
650 0 _aAlgorithms.
_93390
650 0 _aArtificial intelligence
_xData processing.
_921787
650 0 _aComputer science
_xMathematics.
_93866
650 0 _aDiscrete mathematics.
_912873
650 1 4 _aSoftware Engineering.
_94138
650 2 4 _aProgramming Techniques.
_9126354
650 2 4 _aNumerical Analysis.
_94603
650 2 4 _aAlgorithms.
_93390
650 2 4 _aData Science.
_934092
650 2 4 _aDiscrete Mathematics in Computer Science.
_931837
700 1 _aMcGeoch, Catherine C.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9126355
710 2 _aSpringerLink (Online service)
_9126356
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783540685487
776 0 8 _iPrinted edition:
_z9783540848110
830 0 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v5038
_9126357
856 4 0 _uhttps://doi.org/10.1007/978-3-540-68552-4
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
942 _cELN
999 _c91103
_d91103