Experimental Algorithms (Record no. 36326)

000 -LEADER
fixed length control field 05275nam a22005775i 4500
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
ISBN 9783540685524
-- 978-3-540-68552-4
082 04 - DEWEY DECIMAL CLASSIFICATION NUMBER
Classification number 005.1
245 10 - TITLE STATEMENT
Title Experimental Algorithms
Sub Title 7th International Workshop, WEA 2008 Provincetown, MA, USA, May 30-June 1, 2008 Proceedings /
Statement of responsibility, etc edited by Catherine C. McGeoch.
260 #1 - PUBLICATION, DISTRIBUTION, ETC. (IMPRINT)
Place of publication Berlin, Heidelberg :
Name of publisher Springer Berlin Heidelberg,
Year of publication 2008.
300 ## - PHYSICAL DESCRIPTION
Other physical details online resource.
490 1# - SERIES STATEMENT
Series statement Lecture Notes in Computer Science,
505 0# - FORMATTED CONTENTS NOTE
Formatted contents note Reducing 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 ## - SUMMARY, ETC.
Summary, etc The 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 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical Term Computer science.
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical Term Data structures (Computer science).
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical Term Computer software.
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical Term Electronic data processing.
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical Term Computational complexity.
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical Term Computer graphics.
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical Term Algorithms.
650 14 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical Term Computer Science.
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical Term Algorithm Analysis and Problem Complexity.
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical Term Data Structures.
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical Term Discrete Mathematics in Computer Science.
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical Term Numeric Computing.
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical Term Computer Graphics.
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical Term Algorithms.
700 1# - ADDED ENTRY--PERSONAL NAME
Personal name McGeoch, Catherine C.
856 40 - ELECTRONIC LOCATION AND ACCESS
Uniform Resource Identifier http://dx.doi.org/10.1007/978-3-540-68552-4
942 ## - ADDED ENTRY ELEMENTS (KOHA)
Koha item type E-BOOKS
264 #1 -
-- Berlin, Heidelberg :
-- Springer Berlin Heidelberg,
-- 2008.
336 ## -
-- text
-- txt
-- rdacontent
337 ## -
-- computer
-- c
-- rdamedia
338 ## -
-- online resource
-- cr
-- rdacarrier
347 ## -
-- text file
-- PDF
-- rda
830 #0 - SERIES ADDED ENTRY--UNIFORM TITLE
-- 0302-9743 ;
Holdings
Withdrawn status Lost status Damaged status Not for loan Current library Accession Number Uniform Resource Identifier Koha item type
        IMSc Library EBK7032 http://dx.doi.org/10.1007/978-3-540-68552-4 E-BOOKS
The Institute of Mathematical Sciences, Chennai, India

Powered by Koha