Zobrazeno 1 - 10
of 1 458
pro vyhledávání: '"P Bienkowski"'
The Multi-Objective Shortest-Path (MOS) problem finds a set of Pareto-optimal solutions from a start node to a destination node in a multi-attribute graph. To solve the NP-hard MOS problem, the literature explores heuristic multi-objective A*-style a
Externí odkaz:
http://arxiv.org/abs/2411.16667
Publikováno v:
ICDCS 2024
In the well-known Minimum Linear Arrangement problem (MinLA), the goal is to arrange the nodes of an undirected graph into a permutation so that the total stretch of the edges is minimized. This paper studies an online (learning) variant of MinLA whe
Externí odkaz:
http://arxiv.org/abs/2405.15963
In the online disjoint set covers problem, the edges of a hypergraph are revealed online, and the goal is to partition them into a maximum number of disjoint set covers. That is, n nodes of a hypergraph are given at the beginning, and then a sequence
Externí odkaz:
http://arxiv.org/abs/2404.15554
Contract scheduling is a widely studied framework for designing real-time systems with interruptible capabilities. Previous work has showed that a prediction on the interruption time can help improve the performance of contract-based systems, however
Externí odkaz:
http://arxiv.org/abs/2404.12485
Autor:
Linh Trinh, Aleksandra Parzuch, Krzysztof Bienkowski, Piotr Wróbel, Marcin Pisarek, Grzegorz Kaproń, Renata Solarska
Publikováno v:
ACS Omega, Vol 9, Iss 43, Pp 43734-43742 (2024)
Externí odkaz:
https://doaj.org/article/d283aa18913844d19fed282a704c51df
We study the online variant of the Min-Sum Set Cover (MSSC) problem, a generalization of the well-known list update problem. In the MSSC problem, an algorithm has to maintain the time-varying permutation of the list of $n$ elements, and serve a seque
Externí odkaz:
http://arxiv.org/abs/2306.17755
Autor:
Bienkowski, Marcin, Schmid, Stefan
The online bisection problem is a natural dynamic variant of the classic optimization problem, where one has to dynamically maintain a partition of $n$ elements into two clusters of cardinality $n/2$. During runtime, an online algorithm is given a se
Externí odkaz:
http://arxiv.org/abs/2305.01420
In this article we present the effects of our work on the subject of the technical approach to the 3D point cloud data analysis through the use of the Octree method to compress, analyse and compute the initial data.
Comment: 6 pages, 12 figures,
Comment: 6 pages, 12 figures,
Externí odkaz:
http://arxiv.org/abs/2301.06936
Publikováno v:
Communications Biology, Vol 7, Iss 1, Pp 1-15 (2024)
Abstract Robotically assisted proteomics provides insights into the regulation of multiple proteins achieving excellent spatial resolution. However, developing an effective method for spatially resolved quantitative proteomics of formalin fixed paraf
Externí odkaz:
https://doaj.org/article/e1837fd34ef04a03affab9584bfa194a
Autor:
Bienkowski, Marcin, Mucha, Marcin
We study a fundamental model of online preference aggregation, where an algorithm maintains an ordered list of $n$ elements. An input is a stream of preferred sets $R_1, R_2, \dots, R_t, \dots$. Upon seeing $R_t$ and without knowledge of any future s
Externí odkaz:
http://arxiv.org/abs/2209.04870