Competitive algorithms for online conversion problems with interrelated prices
The classical uni-directional conversion algorithms are based on the assumption that prices are arbitrarily chosen from the fixed price interval[m, M] where m and M represent the estimated lower and upper bounds of possible prices 0<m<M. The estimated interval is erroneous and no attempts are...
Main Authors: | Iqbal, Javeria, Ahmad, Iftikhar, Shah, Asadullah |
---|---|
Format: | Article |
Language: | English English |
Published: |
The Science and Information (SAI) Organization Limited
2019
|
Subjects: | |
Online Access: | http://irep.iium.edu.my/74100/ http://irep.iium.edu.my/74100/ http://irep.iium.edu.my/74100/ http://irep.iium.edu.my/74100/7/74100%20Competitive%20Algorithms%20for%20Online%20Conversion.pdf http://irep.iium.edu.my/74100/8/74100%20Competitive%20Algorithms%20for%20Online%20Conversion%20SCOPUS.pdf |
Similar Items
-
Disparity between theory & practice beyond the worst-case competitive analysis
by: Iqbal, Javeria, et al.
Published: (2019) -
Approximate maximum clique algorithm (AMCA): A clever technique for solving the maximum clique problem through near optimal algorithm for minimum vertex cover problem
by: Fayaz, Muhammad, et al.
Published: (2018) -
Mobile online services and measuring user satisfaction: study of Kuwait
by: Shah, Asadullah, et al.
Published: (2015) -
An empirical investigation of factors influencing user satisfaction with online services of mobile communication providers: study of Kuwait
by: Alzabi, Tami, et al.
Published: (2015) -
Online shopping satisfaction in Malaysia: A framework for security, trust and cybercrime
by: Imtiaz Ali, Najma, et al.
Published: (2016)