EconBiz - Find Economic Literature
    • Logout
    • Change account settings
  • A-Z
  • Beta
  • About EconBiz
  • News
  • Thesaurus (STW)
  • Academic Skills
  • Help
  •  My account 
    • Logout
    • Change account settings
  • Login
EconBiz - Find Economic Literature
Publications Events
Search options
Advanced Search history
My EconBiz
Favorites Loans Reservations Fines
    You are here:
  • Home
  • Search: subject:"Running‐Time Analysis"
Narrow search

Narrow search

Year of publication
Subject
All
Ant System Algorithm 1 Asymptotics 1 Cadlag functions 1 Divide and conquer algorithm 1 First‐Hitting Time 1 Pheromone Rate 1 Quicksort 1 Random algorithm 1 Running time analysis 1 Running‐Time Analysis 1 Skorodhod metric 1 Sorting 1 Stochastic process 1 Swarm Intelligence 1
more ... less ...
Online availability
All
Undetermined 2
Type of publication
All
Article 2
Language
All
English 1 Undetermined 1
Author
All
Hao, Zhifeng 1 Huang, Han 1 Lin, Zhiyong 1 Ragab, Mahmoud 1 Roesler, Uwe 1 Wu, Hongyue 1 Zhang, Yushan 1
more ... less ...
Published in...
All
International Journal of Swarm Intelligence Research (IJSIR) 1 Stochastic Processes and their Applications 1
Source
All
RePEc 1 Other ZBW resources 1
Showing 1 - 2 of 2
Cover Image
Running-time Analysis of Ant System Algorithms with Upper-bound Comparison
Huang, Han; Wu, Hongyue; Zhang, Yushan; Lin, Zhiyong; … - In: International Journal of Swarm Intelligence Research (IJSIR) 8 (2017) 4, pp. 1-17
Running-time analysis of ant colony optimization (ACO) is crucial for understanding the power of the algorithm in … computation. This paper conducts a running-time analysis of ant system algorithms (AS) as a kind of ACO for traveling salesman …
Persistent link: https://www.econbiz.de/10012047852
Saved in:
Cover Image
The Quicksort process
Ragab, Mahmoud; Roesler, Uwe - In: Stochastic Processes and their Applications 124 (2014) 2, pp. 1036-1054
Quicksort on the fly returns the input of n reals in increasing natural order during the sorting process. Correctly normalized the running time up to returning the l-th smallest out of n seen as a process in l converges weakly to a limiting process with path in the space of cadlag functions.
Persistent link: https://www.econbiz.de/10010730377
Saved in:
A service of the
zbw
  • Sitemap
  • Plain language
  • Accessibility
  • Contact us
  • Imprint
  • Privacy

Loading...