Zobrazeno 1 - 3
of 3
pro vyhledávání: '"Ardalan Khazraei"'
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783030800482
CiE
CiE
In order to model an efficient learning paradigm, iterative learning algorithms access data one by one, updating the current hypothesis without regress to past data. Prior research investigating the impact of additional requirements on iterative lear
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b143e351b7456362e1dbc115c97e7d96
https://doi.org/10.1007/978-3-030-80049-9_25
https://doi.org/10.1007/978-3-030-80049-9_25
Autor:
Stephan Held, Ardalan Khazraei
Publikováno v:
Approximation and Online Algorithms ISBN: 9783030808785
WAOA
WAOA
The cost-distance Steiner tree problem asks for a Steiner tree in a graph that minimizes the total cost plus a weighted sum of path delays from the root to the sinks. We present an improved approximation for the uniform cost-distance Steiner tree pro
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c5a0d4c6057d0e46efd1115d427071ae
https://doi.org/10.1007/978-3-030-80879-2_13
https://doi.org/10.1007/978-3-030-80879-2_13
Publikováno v:
SPAA
We consider the clock synchronization problem in the (discrete) beeping model: Given a network of n nodes with each node having a clock value δ(v) ∈ {0,... T-1}, the goal is to synchronize the clock values of all nodes such that they have the same
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0c3b6c3f8d6c1f7da53ead9004278818
https://doi.org/10.1145/3350755.3400246
https://doi.org/10.1145/3350755.3400246
