Zobrazeno 1 - 10
of 43
pro vyhledávání: '"Robert Benkoczi"'
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
Publikováno v:
Discrete Applied Mathematics. 319:372-381
We characterize the optimal solution to the linear programming relaxation of the standard formulation for the minimum satisfiability problem. We give a O ( n m 2 ) combinatorial algorithm to solve the fractional version of the minimum satisfiability
Autor:
Robert Benkoczi, Oluwaseun F. Lijoka
Publikováno v:
Networks. 81:75-92
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
Publikováno v:
ICSE (Companion Volume)
We propose a methodology to study and visualize the evolution of the modular structure of a network of functional dependencies in a software system. Our method identifies periods of significant refactoring activities, also known as the evolutionary h
Publikováno v:
Algorithms and Discrete Applied Mathematics ISBN: 9783030392185
CALDAM
CALDAM
We characterize the optimal solution to the LP relaxation of the standard formulation for the minimum satisfiability problem. Based on the characterization, we give a \(O(nm^2)\) combinatorial algorithm to solve the fractional version of the minimum
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2d2076d2a125f7e9738a10633fe2683c
https://doi.org/10.1007/978-3-030-39219-2_23
https://doi.org/10.1007/978-3-030-39219-2_23
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783030148119
TAMC
TAMC
This paper considers the problem of evacuating people located at vertices to a “sink” in a cycle network. In the “minmax-regret” version of this problem, the exact number of evacuees at each vertex is unknown, but only an interval for a possi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::81f327fc88489935874ce0ecb578cd40
https://doi.org/10.1007/978-3-030-14812-6_4
https://doi.org/10.1007/978-3-030-14812-6_4
Publikováno v:
MSR
Several authors have quantified the modularity of software systems in terms of coupling and cohesion metrics. Most of these approaches focus on functional and procedural dependencies in the system. Although highly relevant at the design phase, these