Experimental algorithms : 7th international workshop, WEA 2008, Provincetown, MA, USA, May 30-June 1, 2008 : proceedings
著者
書誌事項
Experimental algorithms : 7th international workshop, WEA 2008, Provincetown, MA, USA, May 30-June 1, 2008 : proceedings
(Lecture notes in computer science, 5038)
Springer, c2008
- タイトル別名
-
WEA 2008
大学図書館所蔵 全3件
  青森
  岩手
  宮城
  秋田
  山形
  福島
  茨城
  栃木
  群馬
  埼玉
  千葉
  東京
  神奈川
  新潟
  富山
  石川
  福井
  山梨
  長野
  岐阜
  静岡
  愛知
  三重
  滋賀
  京都
  大阪
  兵庫
  奈良
  和歌山
  鳥取
  島根
  岡山
  広島
  山口
  徳島
  香川
  愛媛
  高知
  福岡
  佐賀
  長崎
  熊本
  大分
  宮崎
  鹿児島
  沖縄
  韓国
  中国
  タイ
  イギリス
  ドイツ
  スイス
  フランス
  ベルギー
  オランダ
  スウェーデン
  ノルウェー
  アメリカ
注記
Includes bibliographical references and index
内容説明・目次
内容説明
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.
目次
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.
「Nielsen BookData」 より