Hasil Pencarian  ::  Simpan CSV :: Kembali

"This book constitutes the refereed proceedings of the 6th International Workshop on Algorithms and Computation, WALCOM 2012, held in Dhaka, Bangladesh, in February 2012. The 20 full papers presented together with 3 invited papers were carefully reviewed and selected from 50 submissions. The papers are grouped in topical sections on graph algorithms, computational geometry, approximation algorithms, graph drawing; string and data structures, and games and cryptography."

"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."

"Like its three predecessors, this fourth volume in its series covers cutting-edge natural computing and agent-based methodologies in computational finance and economics, option model calibration, financial trend reversal detection, algorithmic trading and more."

"This book is about how to use CGAL two-dimensional arrangements to solve problems. The authors first demonstrate the features of the arrangement package and related packages using small example programs. They then describe applications, i.e., complete standalone programs written on top of CGAL arrangements used to solve meaningful problems, for example, finding the minimum-area triangle defined by a set of points, planning the motion of a polygon translating among polygons in the plane, computing the offset polygon, finding the largest common point sets under approximate congruence, constructing the farthest-point Voronoi diagram, coordinating the motion of two discs moving among obstacles in the plane, and performing Boolean operations on curved polygons. "

"The annual Workshop on Algorithm Engineering and Experiments (ALENEX) provides a forum for the presentation of original research in all aspects of algorithm engineering, including the implementation and experimental evaluation of algorithms and data structures. The workshop was sponsored by SIAM, the Society for Industrial and Applied Mathematics, and SIGACT, the ACM Special Interest Group on Algorithms and Computation Theory. The aim of ANALCO is to provide a forum for the presentation of original research in the analysis of algorithms and associated combinatorial structures."

"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."

"Describes a selection of important parallel algorithms for matrix computations. Reviews the current status and provides an overall perspective of parallel algorithms for solving problems arising in the major areas of numerical linear algebra, including (1) direct solution of dense, structured, or sparse linear systems, (2) dense or structured least squares computations, (3) dense or structured eigenvaluen and singular value computations, and (4) rapid elliptic solvers. The book emphasizes computational primitives whose efficient execution on parallel and vector computers is essential to obtain high performance algorithms. Consists of two comprehensive survey papers on important parallel algorithms for solving problems arising in the major areas of numerical linear algebra--direct solution of linear systems, least squares computations, eigenvalue and singular value computations, and rapid elliptic solvers, plus an extensive up-to-date bibliography (2,000 items) on related research."

"The annual Workshop on Algorithm Engineering and Experiments (ALENEX) provides a forum for the presentation of original research in all aspects of algorithm engineering, including the implementation and experimental evaluation of algorithms and data structures. "

"This research presents significant studies in experimental analysis or in the implementation, testing, and evaluation of algorithms for realistic environments and scenarios. The paper presentations address specific applied areas that present unique challenges in their underlying algorithmic problems as well as methodological issues and standards in the context of empirical research on algorithms and data structures. This proceedings collects extended versions of the 12 papers that were selected for presentation from a pool of 38 submissions."