相关论文: Many greedy cleaners in a Poisson environment
We consider the exploration problem: an agent equipped with a depth sensor must map out a previously unknown environment using as few sensor measurements as possible. We propose an approach based on supervised learning of a greedy…
This paper examines the ability of greedy algorithms to estimate a block sparse parameter vector from noisy measurements. In particular, block sparse versions of the orthogonal matching pursuit and thresholding algorithms are analyzed under…
We have recently introduced a multistep extension of the greedy algorithm for modularity optimization. The extension is based on the idea that merging l pairs of communities (l>1) at each iteration prevents premature condensation into few…
We address a system of weakly interacting particles where the heterogenous connections among the particles are described by a graph sequence and the number of particles grows to infinity. Our results extend the existing law of large numbers…
We study online weighted bipartite matching of reusable resources where an adversarial sequence of requests for resources arrive over time. A resource that is matched is 'used' for a random duration, drawn independently from a…
We consider base-$\beta$ expansions of Parry's type, where $a_0 \geq a_1 \geq 1$ are integers and $a_0<\beta <a_0+1$ is the positive solution to $\beta^2 = a_0\beta + a_1$ (the golden ratio corresponds to $a_0=a_1=1$). The map $x\mapsto…
We study two continuous and isotropic analogues of the model of greedy lattice animals introduced by Cox, Gandolfi, Griffin and Kesten in 1993. In our framework, animals collect masses scattered on a Poisson point process on $\mathbb R^d$,…
We consider a fair division setting where indivisible items are allocated to agents. Each agent in the setting has strictly negative, zero or strictly positive utility for each item. We, thus, make a distinction between items that are good…
Motivated by the successful use of greedy algorithms for Reduced Basis Methods, a greedy method is proposed that selects N input data in an asymptotically optimal way to solve well-posed operator equations using these N data. The operator…
Kernel-based methods provide flexible and accurate algorithms for the reconstruction of functions from meshless samples. A major question in the use of such methods is the influence of the samples locations on the behavior of the…
Non-relativistic quantum particles bounded to a curve in R^2 by attractive contact $\delta$-interaction are considered. The interval between the energy of the transversal bound state and zero is shown to belong to the absolutely continuous…
Consider $N$ particles performing random walks on the $\epsilon$-grid $(\epsilon Z)^d$, $\epsilon>0$ with branching and density-dependent selection: When one of the particles branches, a particle is removed from the most populated site. The…
A navigation on a set of points $S$ is a rule for choosing which point to move to from the present point in order to progress toward a specified target. We study some navigations in the plane where $S$ is a non uniform Poisson point process…
This paper is devoted to the theoretical study of the efficiency, namely, stability of some greedy algorithms. In the greedy approximation theory researchers are mostly interested in the following two important properties of an algorithm --…
We present an approach for systematically anticipating the actions and policies employed by \emph{oblivious} environments in concurrent stochastic games, while maximizing a reward function. Our main contribution lies in the synthesis of a…
Most theories of behavior posit that agents tend to maximize some form of reward or utility. However, animals very often move with curiosity and seem to be motivated in a reward-free manner. Here we abandon the idea of reward maximization,…
In this work we present and analyze a fluid-mechanical model of competition (scavenging) amongst $N$ liquid droplets (individual competitors). The eventual outcome of this competition depends sensitively on the average resource (volume) per…
Using the matrix product formalism we formulate a natural p-species generalization of the asymmetric simple exclusion process. In this model particles hop with their own specific rate and fast particles can overtake slow ones with a rate…
We study the evolution of cooperation in an interacting particle system with two types. The model we investigate is an extension of a two-type biased voter model. One type (called defector) has a (positive) bias $\alpha$ with respect to the…
Social and economic inequality is a plague of the XXI Century. It is continuously widening, as the wealth of a relatively small group increases and, therefore, the rest of the world shares a shrinking fraction of resources. This situation…