Algorithms are at the heart of every nontrivial computer application, and algorithmics is a modern and active area of computer science. Every computer scientist and every …
This handbook provides an up-to-date compendium of fundamental computer science topics, techniques, and applications. Along with updating and revising many of the existing …
Search has been vital to artificial intelligence from the very beginning as a core technique in problem solving. The authors present a thorough overview of heuristic search with a balance …
S Edelkamp, S Schrödl - … Science in Perspective: Essays Dedicated to …, 2003 - Springer
Navigation systems assist almost any kind of motion in the physical world including sailing, flying, hiking, driving and cycling. On the other hand, traces supplied by global positioning …
JS Vitter - … and Trends® in Theoretical Computer Science, 2008 - nowpublishers.com
Data sets in large applications are often too massive to fit completely inside the computer's internal memory. The resulting input/output communication (or I/O) between fast internal …
R Pearce, M Gokhale, NM Amato - SC'10: Proceedings of the …, 2010 - ieeexplore.ieee.org
Processing large graphs is becoming increasingly important for many domains such as social networks, bioinformatics, etc. Unfortunately, many algorithms and implementations do …
viii Preface reason for this change is that sequential processors have ceased to get proportional performance improvements from increased circuit complexity. Although the …
R Dementiev, L Kettner… - Software: Practice and …, 2008 - Wiley Online Library
We present the software library Stxxl that is an implementation of the C++ standard template library (STL) for processing huge data sets that can fit only on hard disks. It supports parallel …
AWC Fu, H Wu, J Cheng, S Chu… - arXiv preprint arXiv …, 2012 - arxiv.org
We study the problem of computing shortest path or distance between two query vertices in a graph, which has numerous important applications. Quite a number of indexes have been …