Related papers: On minimizing cyclists' ascent times
Suppose that a set of mobile agents, each with a predefined maximum speed, want to patrol a fence together so as to minimize the longest time interval during which a point on the fence is left unvisited. In 2011, Czyzowicz, G\k{a}sieniec,…
We suppose that performance is a random variable whose expectation is related to training inputs, and we study four performance measures in a statistical model that relates performance to training. Our aim is to carry out a robust…
Obstacle crossing is an essential component of human locomotion, particularly for individuals with lower limb amputations who face elevated risks of imbalance and falls. While prior studies have explored this task, they often lack a…
In recent years, Reinforcement Learning (RL) has been applied to real-world problems with increasing success. Such applications often require to put constraints on the agent's behavior. Existing algorithms for constrained RL (CRL) rely on…
We analyze hitting times of simple random walk on realizations of the stochastic block model. We show that under some natural assumptions the hitting time averaged over the target vertex asymptotically almost surely given by $N(1+o(1))$. On…
We investigate the average hitting times of simple random walks on the $k$-th power graph $C_N^k$ of the cycle graph $C_N$. First, we show that the average hitting times are characterized by a difference equation corresponding to the graph…
In a model of communication in a social network described by a simple consensus model, we pose the problem of finding a subset of nodes with given cardinality and fixed consensus values that enable the fastest convergence rate to…
It is generally believed that more observations provide more information. However, we observe that in the independence test for rare events, the power of the test is, surprisingly, determined by the number of rare events rather than the…
In this paper we consider a time-division duplex cell-free massive multiple-input multiple-output (MIMO) system where many distributed access points (APs) simultaneously serve many users. A normalized conjugate beamforming scheme, which…
We present a fast and efficient method for studying vacuum stability constraints in multi-scalar theories beyond the Standard Model. This method is designed for a reliable use in large scale parameter scans. The minimization of the scalar…
Based on the Langevin description of the Continuous Time Random Walk (CTRW), we consider a generalization of CTRW in which the waiting times between the subsequent jumps are correlated. We discuss the cases of exponential and slowly…
Objectives: Negative splitting (i.e., finishing the race faster) is a tactic commonly employed by elite marathon athletes, even though research supporting the strategy is scarce. The presence of pacers allows the main runner to run behind a…
In event-based sensing, many sensors independently and asynchronously emit events when there is a change in their input. Event-based sensing can present significant improvements in power efficiency when compared to traditional sampling,…
Network models are routinely downscaled compared to nature in terms of numbers of nodes or edges because of a lack of computational resources, often without explicit mention of the limitations this entails. While reliable methods have long…
Event-triggered control is often argued to lower the average triggering rate compared to time-triggered control while still achieving a desired control goal, e.g., the same performance level. However, this property, often called…
We generalize the notion of minimax convergence rate. In contrast to the standard definition, we do not assume that the sample size is fixed in advance. Allowing for varying sample size results in time-robust minimax rates and estimators.…
In order to describe the velocity and the anaerobic energy of two runners competing against each other for middle-distance races, we present a mathematical model relying on an optimal control problem for a system of ordinary differential…
Self-avoidance is a common mechanism to improve the efficiency of a random walker for covering a spatial domain. However, how this efficiency decreases when self-avoidance is impaired or limited by other processes has remained largely…
We studied simple random-walk models with asymmetric time delays. Stochastic simulations were performed for hyperbolic-tangent fitness functions and to obtain analytical results we approximated them by step functions. A novel behavior has…
One of the first and easy to use techniques for proving run time bounds for evolutionary algorithms is the so-called method of fitness levels by Wegener. It uses a partition of the search space into a sequence of levels which are traversed…