Hasil Pencarian  ::  Simpan CSV :: Kembali

"The papers in this volume were presented at the Ninteenth Annual ACM-SIAM Symposium on Discrete Algorithms, held January 20-22, 2008, in San Francisco, California. The Symposium was jointly sponsored by the SIAM Activity Group on Discrete Mathematics and by SIGACT, the ACM Special Interest Group on Algorithms and Computation Theory."

"Contains 130 papers, which were selected based on originality, technical contribution, and relevance. Although the papers were not formally refereed, every attempt was made to verify the main claims. It is expected that most will appear in more complete form in scientific journals."

"The Symposium was jointly sponsored by the SIAM Activity Group on Discrete Mathematics and by SIGACT, the ACM Special Interest Group on Algorithms and Computation Theory.This volume contains 136 papers that were selected from a field of 491 submissions based on their originality, technical contribution, and relevance. The symposium and the papers focus on research topics related to efficient algorithms and data structures for discrete problems. In addition to the design of such methods and structures, the scope also includes their use, performance analysis, and the mathematical problems related to their development or limitations."

"This symposium concerned research on the use, design, and analysis of efficient algorithms and data structures, and on the mathematical problems related to the development and analysis of discrete algorithms. The papers are based on the extent to which the results yield new insights for the design, use, or analysis of efficient algorithms. Performance analysis cover analytical and experimental, worst-case and average-case performance. The studies are both theoretical or based on real data sets, and address methodological issues involved in performance analysis. They cover the discrete mathematics and experimental and applied algorithms communities."

"The papers in this volume were presented at the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, held January 17-19, 2010, in Austin, TX. The Symposium was jointly sponsored by the SIAM Activity Group on Discrete Mathematics and by SIGACT, the ACM Special Interest Group on Algorithms and Computation Theory."

"We were very pleased to choose papers for presentation at the ACM-SIAM Symposium on Discrete Algorithms (SODA), which will take place in Manhattan in January 2009. A total of 550 short abstracts were submitted, later materializing into 458 submissions, of which 135 were selected. The program committee meeting was entirely electronic and the selection process took place in July and August 2008. The Best Student Paper award was given to the paper "Improved Bounds and New Techniques for Davenport?Schinzel Sequences and Their Generalizations" by Gabriel Nivasch, and the Best Paper award was given to the paper "Natural Algorithms" by Bernard Chazelle. There will be three invited presentations: one by Volker Strassen, as the recipient of the ACM-SIGACT 2008 Knuth prize; one by Michael Jordan; and one by Yuval Peres."

"The papers in this volume were presented at the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, held January 7/9, 2007, in New Orleans, Louisiana. The Symposium was jointly sponsored by the SIAM Activity Group on Discrete Mathematics and by SIGACT, the ACM Special Interest Group on Algorithms and Computation Theory."

"This book constitutes the refereed proceedings of the 20th Annual European Symposium on Algorithms, ESA 2012, held in Ljubljana, Slovenia, in September 2012 in the context of the combined conference ALGO 2012. The 69 revised full papers presented were carefully reviewed and selected from 285 initial submissions: 56 out of 231 in track design and analysis and 13 out of 54 in track engineering and applications. The papers are organized in topical sections such as algorithm engineering, algorithmic aspects of networks, algorithmic game theory, approximation algorithms, computational biology, computational finance, computational geometry, combinatorial optimization, data compression, data structures, databases and information retrieval, distributed and parallel computing, graph algorithms, hierarchical memories, heuristics and meta-heuristics, mathematical programming, mobile computing, on-line algorithms, parameterized complexity, pattern matching, quantum computing, randomized algorithms, scheduling and resource allocation problems, and streaming algorithms."