Zobrazeno 1 - 7
of 7
pro vyhledávání: '"Daya Gaur"'
Publikováno v:
Algorithms, Vol 17, Iss 9, p 377 (2024)
We give an integer linear program formulation for the star bicolouring of bipartite graphs. We develop a column generation method to solve the linear programming relaxation to obtain a lower bound for the minimum number of colours needed. We determin
Externí odkaz:
https://doaj.org/article/717aaa1fc5a1493e9b90a5888ae40ee8
Publikováno v:
Algorithms, Vol 17, Iss 7, p 303 (2024)
A new two-step interior point method for solving linear programs is presented. The technique uses a convex combination of the auxiliary and central points to compute the search direction. To update the central point, we find the best value for step s
Externí odkaz:
https://doaj.org/article/bf0484c9218f4cb4b1ecbddcd7846736
Publikováno v:
Entropy, Vol 24, Iss 3, p 323 (2022)
This paper studies the effect of quantum computers on Bitcoin mining. The shift in computational paradigm towards quantum computation allows the entire search space of the golden nonce to be queried at once by exploiting quantum superpositions and en
Externí odkaz:
https://doaj.org/article/3c920183b4a54d3eaf2f34b36861d5e3
We give an improved non-monotone line search algorithm for stochastic gradient descent (SGD) for functions that satisfy interpolation conditions. We establish theoretical convergence guarantees for the algorithm for strongly convex, convex and non-co
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::628431126b58a51860b51b399876e4a5
https://doi.org/10.21203/rs.3.rs-2285238/v1
https://doi.org/10.21203/rs.3.rs-2285238/v1
Publikováno v:
Communications in Computer and Information Science ISBN: 9789819916412
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::83e245a350e5729764fe72e7f0613e6b
https://doi.org/10.1007/978-981-99-1642-9_3
https://doi.org/10.1007/978-981-99-1642-9_3
Autor:
Daya Gaur, N.S. Narayanaswamy
This book constitutes the proceedings of the Third International Conference on Algorithms and Discrete Applied Mathematics, CALDAM 2017, held in Goa, India, in February 2017. The 32 papers presented in this volume were carefully reviewed and selected
Autor:
Neal Young, Carlos Cotta, Cristina Fernandes, Roberto Battiti, Xiaotie Deng, Yao-Ting Huang, Alexander Zelikovsky, Luís Paquete, Cristina M. Pinotti, Daya Gaur, Christian Blum, Anthony Man-Cho So, Derong Liu, Vincenzo Bonifaci, Joachim Gudmundsson, Silvia Ghilezan
Publikováno v:
Handbook of Approximation Algorithms and Metaheuristics
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3df9c17fb916d30b10ddcbc10da7f4aa
https://doi.org/10.1201/9781420010749
https://doi.org/10.1201/9781420010749