Zobrazeno 1 - 10
of 75
pro vyhledávání: '"Rada, Miroslav"'
Autor:
Horáček, Jaroslav, Rada, Miroslav
There are many entities that disseminate in the physical space - information, gossip, mood, innovation etc. Personal spaces are also entities that disperse and interplay. In this work we study the emergence of configurations formed by participants wh
Externí odkaz:
http://arxiv.org/abs/2405.19895
Autor:
Garajová, Elif, Rada, Miroslav
We consider the model of a transportation problem with the objective of finding a minimum-cost transportation plan for shipping a given commodity from a set of supply centers to the customers. Since the exact values of supply and demand and the exact
Externí odkaz:
http://arxiv.org/abs/2301.12785
We propose an exact iterative algorithm for minimization of a class of continuous cell-wise linear convex functions on a hyperplane arrangement. Our particular setup is motivated by evaluation of so-called rank estimators used in robust regression, w
Externí odkaz:
http://arxiv.org/abs/1912.12750
Autor:
Baborák, Jan, Vařák, Petr, Canizarès, Aurélien, Rada, Miroslav, Genevois, Cécile, Pitcher, Michael J., Véron, Emmanuel, Zandonà, Alessio, Allix, Mathieu, Nekvindová, Pavla
Publikováno v:
In Ceramics International 15 December 2023 49(24) Part A:40821-40830
We consider the quadratic optimization problem $\max_{x \in C}\ x^T Q x + q^T x$, where $C\subseteq\mathbb{R}^n$ is a box and $r := \mathrm{rank}(Q)$ is assumed to be $\mathcal{O}(1)$ (i.e., fixed). We show that this case can be solved in polynomial
Externí odkaz:
http://arxiv.org/abs/1911.10877
A rank estimator in robust regression is a minimizer of a function which depends (in addition to other factors) on the ordering of residuals but not on their values. Here we focus on the optimization aspects of rank estimators. We distinguish two cla
Externí odkaz:
http://arxiv.org/abs/1910.05826
We consider the algorithm by Ferson et al. (Reliable computing 11(3), p. 207-233, 2005) designed for solving the NP-hard problem of computing the maximal sample variance over interval data, motivated by robust statistics (in fact, the formulation can
Externí odkaz:
http://arxiv.org/abs/1905.07821
Interval linear programming provides a tool for solving real-world optimization problems under interval-valued uncertainty. Instead of approximating or estimating crisp input data, the coefficients of an interval program may perturb independently wit
Externí odkaz:
http://arxiv.org/abs/1802.09872
We address the problem of testing weak optimality of a given solution of a given interval linear program. The problem was recently wrongly stated to be polynomially solvable. We disprove it. We show that the problem is NP-hard in general. We propose
Externí odkaz:
http://arxiv.org/abs/1712.00350
Autor:
RADA, Miroslav
My thesis deal with topic: "Work activities as a subject of motivation for an apprenticeship selection". The basic idea is an opportunity of cooperation between primary and secondary vocational schools in field of work activities. They do not take pl
Externí odkaz:
http://www.nusl.cz/ntk/nusl-137411