Bounded : incremental computation
Incremental computation concerns the re-computation of output after a change in the input, whereas algorithms and programs usually derive their output directly from their input. This book investigates the concept of incremental computation and dynamic algorithms in general and provides a variety of...
Uloženo v:
| Hlavní autor: | |
|---|---|
| Médium: | Livre numérique |
| Jazyk: | Anglais |
| Vydáno: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Edice: | Lecture notes in computer science
1089 |
| Témata: | |
| On-line přístup: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Poznámka: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • Bounded, incremental computation, G. Ramalingam, 1996, Berlin, Springer, 1 vol. (XI-190 p.), Lecture notes in computer science, 3-540-61320-X • Bounded Incremental Computation, Texte imprimé, 9783662210802 |
Obsah:
- On incremental algorithms and their complexity
- Terminology and notation
- Incremental algorithms for shortest-path problems
- Generalizations of the shortest-path problem
- An incremental algorithm for a generalization of the shortest-path problem
- Incremental algorithms for the circuit value annotation problem
- Inherently unbounded incremental computation problems
- Incremental algorithms for reducible flowgraphs
- Conclusions.