Related papers: Many greedy cleaners in a Poisson environment

The greedy walk is a deterministic walk that always moves from its current position to the nearest not yet visited point. In this paper we consider the greedy walk on an inhomogeneous Poisson point process on the real line. Our primary…

We consider a self-interacting process described in terms of a single-server system with service stations at each point of the real line. The customer arrivals are given by a Poisson point processes on the space-time half plane. The server…

The greedy walk is a walk on a point process that always moves from its current position to the nearest not yet visited point. We consider here various point processes on two lines. We look first at the greedy walk on two independent…

Given a Poisson point process on R, assign either one or two marks to each point of this process, independently of the others. We study the motion of a particle that jumps deterministically from its current location to the nearest point of…

In this paper we introduce several extremal sequences of points on locally compact metric spaces and study their asymptotic properties. These sequences are defined through a greedy algorithm by minimizing a certain energy functional whose…

A service system with multiple types of customers, arriving as Poisson processes, is considered. The system has infinite number of servers, ranked by $1,2,3, \ldots$; a server rank is its ``location." Each customer has an independent…

Motivated by the change-making problem, we extend the notion of greediness to sets of positive integers not containing the element $1$, and from there to numerical semigroups. We provide an algorithm to determine if a given set (not…

We prove functional limits theorems for the occupation time process of a system of particles moving independently in $R^d$ according to a symmetric $\alpha$-stable L\'evy process, and starting off from an inhomogeneous Poisson point measure…

We introduce a new random input model for bipartite matching which we call the Random Type Poisson Arrival Model. Just like in the known i.i.d. model (introduced by Feldman et al. 2009), online nodes have types in our model. In contrast to…

This paper proposes a greedy algorithm named as Big step greedy set cover algorithm to compute approximate minimum set cover. The Big step greedy algorithm, in each step selects p sets such that the union of selected p sets contains…

We describe the Greedy Sparse Subspace Clustering (GSSC) algorithm providing an efficient method for clustering data belonging to a few low-dimensional linear or affine subspaces from incomplete corrupted and noisy data. We provide…

The greedy algorithm A iterates over a set of uniformly sized independent sets of a given graph G and checks for each set S which non-neighbor of S, if any, is best suited to be added to S, until no more suitable non-neighbors are found for…

A service system with multiple types of customers, arriving according to Poisson processes, is considered. The system is heterogeneous in that the servers also can be of multiple types. Each customer has an independent exponentially…

Motivated by the Dobrushin uniqueness theorem in statistical mechanics, we consider the following situation: Let \alpha be a nonnegative matrix over a finite or countably infinite index set X, and define the "cleaning operators" \beta_h =…

Recent work on exploration in reinforcement learning (RL) has led to a series of increasingly complex solutions to the problem. This increase in complexity often comes at the expense of generality. Recent empirical studies suggest that,…

We propose a greedy algorithm to select $N$ important features among $P$ input features for a non-linear prediction problem. The features are selected one by one sequentially, in an iterative loss minimization procedure. We use neural…

An approach for effective implementation of greedy selection methodologies, to approximate an image partitioned into blocks, is proposed. The method is specially designed for approximating partitions on a transformed image. It evolves by…

Particles labelled $1,...,n$ are initially arranged in increasing order. Subsequently, each pair of neighboring particles that is currently in increasing order swaps according to a Poisson process of rate 1. We analyze the asymptotic…

It is known that a basis is almost greedy if and only if the thresholding greedy algorithm gives essentially the smallest error term compared to errors from projections onto intervals or in other words, consecutive terms of $\mathbb{N}$. In…

For a sensor network, a tractable spatially-dependent node deployment model is presented with the property that the density is inversely proportional to the sink distance. A stochastic model is formulated to examine message advancements…