نتایج جستجو برای: imperialistic competitive algorithm

تعداد نتایج: 833071  

Journal: :Inf. Process. Lett. 2010
Leah Epstein Asaf Levin

In the online bidding problem, a bidder is trying to guess a positive number T , by placing bids until the value of the bid is at least T . The bidder is charged with the sum of the bids. In the bounded online bidding problem, a parameter k is given, and the bidder is charged only with the largest k bids. It is known that the online bidding problem admits a 4-competitive deterministic algorithm...

1997
Steven S. Seiden

e a lower bound which converges to ~ as m goes to infinity. Prior to this work, no randomized algorithm for m > 2 was known. A randomized algorithm for m ~ 3 is presented. It achieves competitive ratios of 1.55665, 1.65888, 1.73376, 1.78295 and 1.81681, for m = 3 , . . . , 7 respectively. These competitive ratios are less than the best deterministic lower bound for m = 3,4, 5 and less than the ...

1996
Susanne Albers

Overview Over the past ten years, online algorithms have received considerable research interest. Online problems had been investigated already in the seventies and early eighties but an extensive, systematic study only started when Sleator and Tarjan (1985) suggested comparing an online algorithm to an optimal ooine algorithm and Karlin, Manasse, Rudolph and Sleator (1988) coined the term comp...

Journal: :International Journal of Industrial Engineering Computations 2015

2001
Qun Li Javed Aslam Daniela Rus

This paper discusses online power-aware routing in large sensor networks. We seek to optimize the lifetime of the network. We develop an approximation algorithm called max-min zPmin that has a good empirical competitive ratio. To ensure scalability, we introduce a hierarchical algorithm, which is called zone-based routing.

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید