Rudolf Fleischer – författare
Visar alla böcker från författaren Rudolf Fleischer. Handla med fri frakt och snabb leverans.
5 produkter
5 produkter
Del 8993 - Lecture Notes in Computer Science
Intelligent Cloud Computing
First International Conference, ICC 2014, Muscat, Oman, February 24-26, 2014, Revised Selected Papers
Häftad, Engelska, 2015
445 kr
Skickas inom 10-15 vardagar
This book constitutes the refereed post-conference proceedings of the First International Conference on Intelligent Cloud Computing, held in Muscat, Oman, in February 2014. They include 5 invited talks from leading organizations working in cloud computing in Oman and in the region.
Del 10787 - Lecture Notes in Computer Science
Approximation and Online Algorithms
15th International Workshop, WAOA 2017, Vienna, Austria, September 7–8, 2017, Revised Selected Papers
Häftad, Engelska, 2018
538 kr
Skickas inom 10-15 vardagar
This book constitutes the thoroughly refereed workshop post-proceedings of the 15th International Workshop on Approximation and Online Algorithms, WAOA 2017, held in Vienna, Austria, in September 2017 as part of ALGO 2017.The 23 revised full papers presented in this book were carefully reviewed and selected from 50 submissions. Topics of interest for WAOA 2017 were: graph algorithms; inapproximability results; network design; packing and covering; paradigms for the design and analysis of approximation and online algorithms; parameterized complexity; scheduling problems; algorithmic game theory; coloring and partitioning; competitive analysis; computational advertising; computational finance; cuts and connectivity; geometric problems; mechanism design; resource augmentation; and real-world applications.
Experimental Algorithmics
From Algorithm Design to Robust and Efficient Software
Häftad, Engelska, 2002
554 kr
Skickas inom 10-15 vardagar
Experimental algorithmics, as its name indicates, combines algorithmic work and experimentation: algorithms are not just designed, but also implemented and tested on a variety of instances. Perhaps the most important lesson in this process is that designing an algorithm is but the first step in the process of developing robust and efficient software for applications.Based on a seminar held at Dagstuhl Castle, Germany in September 2000, this state-of-the-art survey presents a coherent survey of the work done in the area so far. The 11 carefully reviewed chapters provide complete coverage of all current topics in experimental algorithmics.
Algorithms and Computation
15th International Symposium, ISAAC 2004, Hong Kong, China, December 20-22, 2004, Proceedings
Häftad, Engelska, 2004
1 101 kr
Skickas inom 10-15 vardagar
This book constitutes the refereed proceedings of the 15th International Symposium on Algorithms and Computation, ISAAC 2004, held in Hong Kong, China in December 2004.The 76 revised full papers presented were carefully reviewed and selected from 226 submissions. Among the topics addressed are computational geometry, graph computations, computational combinatorics, combinatorial optimization, computational complexity, scheduling, distributed algorithms, parallel algorithms, data structures, network optimization, randomized algorithms, and computational mathematics more generally.
Algorithmic Aspects in Information and Management
4th International Conference, AAIM 2008, Shanghai, China, June 23-25, 2008, Proceedings
Häftad, Engelska, 2008
554 kr
Skickas inom 10-15 vardagar
This book constitutes the refereed proceedings of the 4th International Conference on Algorithmic Aspects in Information and Management, AAIM 2008, held in Shanghai, China, in June 2008. The 30 revised full papers presented together with abstracts of 2 invited talks were carefully reviewed and selected from 53 submissions. The papers cover original algorithmic research on immediate applications and/or fundamental problems pertinent to information management and management science. Topics addressed are: approximation algorithms, geometric data management, biological data management, graph algorithms, computational finance, mechanism design, computational game theory, network optimization, data structures, operations research, discrete optimization, online algorithms, FPT algorithms, and scheduling algorithms.