We discuss a wide range of matching problems in terms of a network flow model. More than this, we start up a matching theory which is very intuitive and independent from the original graph context. This first paper contains a standardized theory for the performance analysis of augmentation algorithm
โฆ LIBER โฆ
A framework for the design of dependent-failure algorithms
โ Scribed by Flavio Junqueira; Keith Marzullo
- Publisher
- John Wiley and Sons
- Year
- 2007
- Tongue
- English
- Weight
- 214 KB
- Volume
- 19
- Category
- Article
- ISSN
- 1532-0626
- DOI
- 10.1002/cpe.1170
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
Balanced network flows. I. A unifying fr
โ
Fremuth-Paeger, Christian; Jungnickel, Dieter
๐
Article
๐
1999
๐
John Wiley and Sons
๐
English
โ 418 KB
๐ 2 views
On the design of algorithms for mobile m
โ
Xiaoqiang Ma; Jiangchuan Liu; Hongbo Jiang
๐
Article
๐
2011
๐
John Wiley and Sons
๐
English
โ 210 KB
๐ 1 views
Algorithms for the design of finite-capa
โ
S. Chakravarthy; Marcel F. Neuts
๐
Article
๐
1989
๐
John Wiley and Sons
๐
English
โ 685 KB
A tutorial on using genetic algorithms f
โ
Bassam Al-Bassam; Abdulmohsen Alheraish; Saad Haj Bakry
๐
Article
๐
2006
๐
John Wiley and Sons
๐
English
โ 171 KB
Decomposition algorithms for the design
โ
April K. Andreas; J. Cole Smith
๐
Article
๐
2009
๐
John Wiley and Sons
๐
English
โ 225 KB
The design and evaluation of a buffer al
โ
Cai, F. F.; Hull, M. E. C.; Bell, D. A.
๐
Article
๐
1998
๐
John Wiley and Sons
๐
English
โ 368 KB
๐ 2 views
This paper reports on the design, development and evaluation of a buffer algorithm named RESBAL, which exploits parallelism in order to provide high query execution performance in relational database systems. The algorithm aims to provide both predictive and efficient data buffering by exploiting th