A Constant-Competitive Algorithm for Online OVSF Code Assignment

Algorithms and Computation - Lecture Notes in Computer Science ◽

10.1007/978-3-540-77120-3_40 ◽

2007 ◽

pp. 452-463 ◽

Author(s):

F. Y. L. Chin ◽

H. F. Ting ◽

Y. Zhang

Keyword(s):

Code Assignment ◽

Competitive Algorithm

Download Full-text

(1+ε)-competitive algorithm for online OVSF code assignment with resource augmentation

Journal of Combinatorial Optimization ◽

10.1007/s10878-012-9454-2 ◽

2012 ◽

Vol 26 (4) ◽

pp. 687-708

Author(s):

Yuichi Asahiro ◽

Kenta Kanmera ◽

Eiji Miyano

Keyword(s):

Resource Augmentation ◽

Code Assignment ◽

Competitive Algorithm

Download Full-text

(1 + ε)-Competitive Algorithm for Online OVSF Code Assignment with Resource Augmentation

Lecture Notes in Computer Science - Computing and Combinatorics ◽

10.1007/978-3-642-22685-4_24 ◽

2011 ◽

pp. 259-270

Author(s):

Yuichi Asahiro ◽

Kenta Kanmera ◽

Eiji Miyano

Keyword(s):

Resource Augmentation ◽

Code Assignment ◽

Competitive Algorithm

Download Full-text

A Constant-Competitive Algorithm for Online OVSF Code Assignment

Algorithmica ◽

10.1007/s00453-008-9241-8 ◽

2008 ◽

Vol 56 (1) ◽

pp. 89-104 ◽

Author(s):

F. Y. L. Chin ◽

H. F. Ting ◽

Y. Zhang

Keyword(s):

Code Assignment ◽

Competitive Algorithm

Download Full-text

Dynamic code assignment in hybrid MC-CDMA/TDMA systems

European Transactions on Telecommunications ◽

10.1002/ett.4460140107 ◽

2003 ◽

Vol 14 (1) ◽

pp. 49-59 ◽

Author(s):

Chin-Lung Yang ◽

Jin-Fu Chang

Keyword(s):

Code Assignment

Download Full-text

A Hybrid Proposed Imperialist Competitive Algorithm with Conjugate Gradient Approach for Large Scale Global Optimization

Science Journal of University of Zakho ◽

10.25271/2014.2.1.173 ◽

2014 ◽

Vol 2 (1) ◽

pp. 184-195

Author(s):

Ban Mitras ◽

Jalal Sultan

Keyword(s):

Global Optimization ◽

Conjugate Gradient ◽

Large Scale ◽

Imperialist Competitive Algorithm ◽

Competitive Algorithm ◽

Gradient Approach

Download Full-text

Erratum: Dieu, T.B. et al. A Novel Integrated Approach of Relevance Vector Machine Optimized by Imperialist Competitive Algorithm for Spatial Modeling of Shallow Landslides. Remote Sens. 2018, 10, 1538

Remote Sensing ◽

10.3390/rs11010057 ◽

2018 ◽

Vol 11 (1) ◽

pp. 57 ◽

Author(s):

Dieu Tien Bui ◽

Himan Shahabi ◽

Ataollah Shirzadi ◽

Kamran Kamran Chapi ◽

Nhat-Duc Hoang ◽

...

Keyword(s):

Spatial Modeling ◽

Imperialist Competitive Algorithm ◽

Integrated Approach ◽

Relevance Vector Machine ◽

Shallow Landslides ◽

Competitive Algorithm

The authors wish to make the following corrections to this paper [...]

Download Full-text

MOICA: A novel multi-objective approach based on imperialist competitive algorithm

Applied Mathematics and Computation ◽

10.1016/j.amc.2013.03.099 ◽

2013 ◽

Vol 219 (17) ◽

pp. 8829-8841 ◽

Author(s):

Rasul Enayatifar ◽

Moslem Yousefi ◽

Abdul Hanan Abdullah ◽

Amer Nordin Darus

Keyword(s):

Imperialist Competitive Algorithm ◽

Multi Objective ◽

Competitive Algorithm

Download Full-text

TBM performance prediction developing a hybrid ANFIS-PNN predictive model optimized by imperialism competitive algorithm

Neural Computing and Applications ◽

10.1007/s00521-021-06217-x ◽

2021 ◽

Author(s):

Hooman Harandizadeh ◽

Danial Jahed Armaghani ◽

Panagiotis G. Asteris ◽

Amir H. Gandomi

Keyword(s):

Predictive Model ◽

Performance Prediction ◽

Tbm Performance ◽

Competitive Algorithm ◽

Imperialism Competitive Algorithm

Download Full-text

Multi-objective optimization of energy use and environmental emissions for walnut production using imperialist competitive algorithm

Applied Energy ◽

10.1016/j.apenergy.2020.116342 ◽

2020 ◽

pp. 116342

Author(s):

Majid Khanali ◽

Asadollah Akram ◽

Javad Behzadi ◽

Fatemeh Mostashari-Rad ◽

Zahra Saber ◽

...

Keyword(s):

Imperialist Competitive Algorithm ◽

Multi Objective Optimization ◽

Multi Objective ◽

Competitive Algorithm ◽

Environmental Emissions

Download Full-text

SIGACT News Online Algorithms Column 37

ACM SIGACT News ◽

10.1145/3471469.3471480 ◽

2021 ◽

Vol 52 (2) ◽

pp. 71-71

Author(s):

Rob van Stee

Keyword(s):

Lower Bound ◽

Online Algorithms ◽

Packet Scheduling ◽

Open Problems ◽

Competitive Algorithm ◽

Long Time ◽

For this issue, Pavel Vesely has contributed a wonderful overview of the ideas that were used in his SODA paper on packet scheduling with Marek Chrobak, Lukasz Jez and Jiri Sgall. This is a problem for which a 2-competitive algorithm as well as a lower bound of ϕ ≈ 1:618 was known already twenty years ago, but which resisted resolution for a long time. It is great that this problem has nally been resolved and that Pavel was willing to explain more of the ideas behind it for this column. He also provides an overview of open problems in this area.

Download Full-text