Výsledky vyhledávání - "Average Case Analysis"

Akademický článek

Coresets for the Average Case Error for Finite Query Sets

Autor: Alaa Maalouf, Ibrahim Jubran, Murad Tukan, Dan Feldman

Publikováno v: Sensors, Vol 21, Iss 19, p 6689 (2021)

Coreset is usually a small weighted subset of an input set of items, that provably approximates their loss function for a given set of queries (models, classifiers, hypothesis). That is, the maximum (worst-case) error over all queries is bounded. To

Externí odkaz: https://doaj.org/article/26bcef9252b0428280e372df224f3a98

Zobrazit plný text záznamu

Plný text ve formátu HTML

Akademický článek

Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.

Akademický článek

A Multi-Objective Optimization Problem on Evacuating 2 Robots from the Disk in the Face-to-Face Model; Trade-Offs between Worst-Case and Average-Case Analysis

Autor: Huda Chuangpishit, Konstantinos Georgiou, Preeti Sharma

Publikováno v: Information, Vol 11, Iss 11, p 506 (2020)

The problem of evacuating two robots from the disk in the face-to-face model was first introduced by Czyzowicz et al. [DISC’2014], and has been extensively studied (along with many variations) ever since with respect to worst-case analysis. We init

Externí odkaz: https://doaj.org/article/58cb5cb4785e457f997f5787f3ae2ba0

Zobrazit plný text záznamu

Plný text ve formátu HTML

Probabilistic properties of highly connected random geometric graphs

Autor: Manthey, Bodo, Reijnders, Victor Maria Jacobus Johannes, Panda, B.S., Goswami, Partha P.

Publikováno v: ISSUE=15;STARTPAGE=105;ENDPAGE=108;TITLE=15th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, CTW 2017
Algorithms and Discrete Applied Mathematics ISBN: 9783319741796
CALDAM
Algorithms and Discrete Applied Mathematics-4th International Conference, CALDAM 2018, Proceedings: 4th International Conference, CALDAM 2018, Guwahati, India, February 15-17, 2018, Proceedings, 59-72
STARTPAGE=59;ENDPAGE=72;TITLE=Algorithms and Discrete Applied Mathematics-4th International Conference, CALDAM 2018, Proceedings
Discrete applied mathematics, 366-376. Elsevier
STARTPAGE=366;ENDPAGE=376;ISSN=0166-218X;TITLE=Discrete applied mathematics

We study the probabilistic properties of reliable networks of minimum costs in d -dimensional Euclidean space, with reliability in terms of k -edge-connectivity in graphs. We show that this problem fits into Yukich’s framework for Euclidean functio

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1ad47375b9da2e2fe284497f084c8312
http://www.scopus.com/inward/record.url?scp=85065832515&partnerID=8YFLogxK

Zobrazit plný text záznamu

Akademický článek

Solving the (n2 − 1)-Puzzle with 8/3 n3 Expected Moves

Autor: Ian Parberry

Publikováno v: Algorithms, Vol 8, Iss 3, Pp 459-465 (2015)

It is shown that the greedy algorithm for the \((n^2-1)\)-puzzle makes \(\tfrac{8}{3}n^3 +O(n^2)\) expected moves. This analysis is verified experimentally on 10,000 random instances each of the \((n^2-1)\)-puzzle for \(4 \leq n \leq 200\).

Externí odkaz: https://doaj.org/article/7f898afea3304609b9528e62a044f285

Zobrazit plný text záznamu

On the well-spread property and its relation to linear regression

Autor: Chen, Hongjie, d'Orsi, Tommaso

Publikováno v: Proceedings of Machine Learning Research, 178
Proceedings of Thirty Fifth Conference on Learning Theory

Proceedings of Machine Learning Research, 178
ISSN:2640-3498
Proceedings of Thirty Fifth Conference on Learning Theory

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c65f3c6b3acc48e26adccc98f130d8e3
http://arxiv.org/abs/2206.08092

Zobrazit plný text záznamu

Vyhledávací nástroje:

Upřesnit hledání