๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Algorithms and time complexity of the request-service problem

โœ Scribed by Chunmei Liu; Legand Burge; Ajoni Blake

Publisher
Springer US
Year
2008
Tongue
English
Weight
461 KB
Volume
20
Category
Article
ISSN
1382-6905

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

The time-dependent shortest pair of disj
The time-dependent shortest pair of disjoint paths problem: Complexity, models, and algorithms
โœ Sherali, Hanif D.; Ozbay, Kaan; Subramanian, Shivaram ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 160 KB ๐Ÿ‘ 3 views

In this paper, we examine complexity issues, models, and algorithms for the problem of finding a shortest pair of disjoint paths between two nodes of a network such that the total travel delay is minimized, given that the individual arc delays are time-dependent. Such disjoint paths address the issu

Drift analysis and average time complexi
Drift analysis and average time complexity of evolutionary algorithms
โœ Jun He; Xin Yao ๐Ÿ“‚ Article ๐Ÿ“… 2001 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 212 KB

The computational time complexity is an important topic in the theory of evolutionary algorithms (EAs). This paper reports some new results on the average time complexity of EAs. Based on drift analysis, some useful drift conditions for deriving the time complexity of EAs are studied, including cond