The contextual bandit literature has traditionally focused on algorithms that address the explorationexploitation tradeoff. In particular, greedy algorithms that exploit current estimates without any exploration may be sub-optimal in general. However, exploration-free greedy algorithms are desirable in practical settings where exploration may be costly or unethical (e.g., clinical trials). Surp...

An algorithm that uses the greedy method attempts to construct an optimal (compound) solution to a problem by optimally constructing components one by one. In general, building up locally optimal components may not yield a globally optimal overall solution, but a greedy algorithm will give an optimal result if these two coincide. There are two main issues that arise when applying the greedy app...

We propose a greedy reconstruction algorithm to find the probability distribution of parameter characterizing an inhomogeneous spin ensemble in Nuclear Magnetic Resonace. The identification is based on application number constant control processes during given time for which final magnetization vector measured. From these experimental data, we show that identifiability piecewise approximation r...

This work develops a mathematical formulation to determine the combinatorial search space of Offshore Wind Transmission Optimization Problem (OWTOP). The model accounts for Capital Expenditures (CAPEX), Corrective Maintenance (CM), losses and Expected Energy Not Transmitted (EENT) determines optimal radial transmission system topology connect number Power Plants (OWPPs) shore. also considers st...

Abstract In this paper, we propose a linear assignment problem (LAP) scheme using greedy algorithms to alleviate the intercell interference (ICI) in massive multi-input multiple-output (maMIMO) systems. ICI has been recognized as one of main challenges MIMO systems and occurs when pilot sequences (PSs) are reused across neighboring cells or non-orthogonal PS, results phenomenon known contaminat...

This paper is devoted to research of a selection problem of mechanisms for management of information risks. We propose to use a heuristic algorithm of a selection, which relates to the class "greedy algorithms". This algorithm allows to consider incompatibility of control mechanisms and use of integrated mechanisms. We compared the modified greedy algorithm, the genetic algorithm, and algorithm...