https://www.econstor.eu/handle/10419/177310
EconStor: A competitive exact algorithm for assembly line balancing
EconStor is a publication server for scholarly economic literature, provided as a non-commercial public service by the ZBW.
exact algorithmfor assemblyeconstorcompetitiveline
https://deepai.org/publication/an-exact-algorithm-for-minimum-weight-vertex-cover-problem-in-large-graphs
An Exact Algorithm for Minimum Weight Vertex Cover Problem in Large Graphs | DeepAI
Mar 14, 2019 - 03/14/19 - This paper proposes a novel branch-and-bound(BMWVC) algorithm to exactly solve the minimum weight vertex cover problem (MWVC) in l...
vertex cover problem
https://deepai.org/publication/an-algorithm-for-exact-numerical-age-of-information-evaluation-in-multi-agent-systems
An Algorithm for Exact Numerical Age-of-Information Evaluation in Multi-Agent Systems | DeepAI
Jun 11, 2022 - 06/11/22 - We present an algorithm for the numerical evaluation of the state-space distribution of an Age-of-Information network. Given enoug...
https://openreview.net/forum?id=nVO6YTca8O
DSGD-CECA: Decentralized SGD with Communication-Optimal Exact Consensus Algorithm | OpenReview
Decentralized Stochastic Gradient Descent (SGD) is an emerging neural network training approach that enables multiple agents to train a model collaboratively...
consensus algorithmcecadecentralizedsgd
https://arxiv.org/abs/1406.0492
[1406.0492] Dijkstra meets Steiner: a fast exact goal-oriented Steiner tree algorithm
Abstract page for arXiv paper 1406.0492: Dijkstra meets Steiner: a fast exact goal-oriented Steiner tree algorithm
https://www.kth.se/math/kalender/an-exact-algorithm-for-semi-supervised-support-vector-machines-using-strong-sdp-bounds-1.1332444?date=2024-04-17&orgdate=2024-02-13&length=1&orglength=0
An Exact Algorithm for Semi-Supervised Support Vector Machines using Strong SDP Bounds | KTH
Support vector machines (SVMs) are well-studied supervised learning models for binary classification. They have proven to be powerful machine learning...