Related papers: Self-stabilizing Overlays for high-dimensional Mon…
Quadrotors hold significant promise for several applications such as agriculture, search and rescue, and infrastructure inspection. Achieving autonomous operation requires systems to navigate safely through complex and unfamiliar…
We introduce a system with competing self-focusing (SF) and self-defocusing (SDF) terms, which have the same scaling dimension. In the one-dimensional (1D) system, this setting is provided by a combination of the SF cubic term multiplied by…
Decoupling the permanent identifier of a node from the node's topology-dependent address is a promising approach toward completely scalable self-organizing networks. A group of proposals that have adopted such an approach use the same…
Restarting a stochastic search process can accelerate its completion by providing an opportunity to take a more favorable path with each reset. This strategy, known as stochastic resetting, is well studied in random processes. Here, we…
Structural decomposition methods have been developed for identifying tractable classes of instances of fundamental problems in databases, such as conjunctive queries and query containment, of the constraint satisfaction problem in…
We investigate the searchability of complex systems in terms of their interconnectedness. Associating searchability with the number and size of branch points along the paths between the nodes, we find that scale-free networks are relatively…
During the last decade, the paradigm of compressed sensing has gained significant importance in the signal processing community. While the original idea was to utilize sparsity assumptions to design powerful recovery algorithms of vectors…
Self-stabilization ensures that, after any transient fault, the system recovers in a finite time and eventually exhibits. Speculation consists in guaranteeing that the system satisfies its requirements for any execution but exhibits…
Adaptive regularized framework using cubics has emerged as an alternative to line-search and trust-region algorithms for smooth nonconvex optimization, with an optimal complexity amongst second-order methods. In this paper, we propose and…
We deal with the problem of maintaining a shortest-path tree rooted at some process r in a network that may be disconnected after topological changes. The goal is then to maintain a shortest-path tree rooted at r in its connected component,…
A search strategy for asymptotic safety is put forward and tested for a simplified version of gravity in four dimensions using the renormalization group. Taking the action to be a high-order polynomial of the Ricci scalar, a self-consistent…
We construct and investigate Boolean networks that follow a given reliable trajectory in state space, which is insensitive to fluctuations in the updating schedule, and which is also robust against noise. Robustness is quantified as the…
A new pattern search method for bound constrained optimization is introduced. The proposed algorithm employs the coordinate directions, in a suitable way, with a nonmonotone line search for accepting the new iterate, without using…
This study propose a continuous pathfinding system based on coupled oscillator systems. We consider acyclic graphs whose vertices are connected by unidirectional edges. The proposed model autonomously finds a path connecting two specified…
We investigate a discrete model consisting of self-propelled particles that obey simple interaction rules. We show that this model can self-organize and exhibit coherent localized solutions in one- and in two-dimensions.In one-dimension,…
We develop a stability theory for two-dimensional periodic traveling waves of general parabolic systems, possibly including conservation laws. In particular, we identify a diffusive spectral stability assumption and prove that it implies…
Small networks of chaotic units which are coupled by their time-delayed variables, are investigated. In spite of the time delay, the units can synchronize isochronally, i.e. without time shift. Moreover, networks can not only synchronize…
A wide variety of intricate dynamics may be created at border-collision bifurcations of piecewise-smooth maps, where a fixed point collides with a surface at which the map is nonsmooth. For the border-collision normal form in two…
We study a generalized binary search problem on the line and general trees. On the line (e.g., a sorted array), binary search finds a target node in $O(\log n)$ queries in the worst case, where $n$ is the number of nodes. In situations with…
We study the design of one-to-one matching mechanisms that are strategy-proof for both sides and as stable as possible. Motivated by the impossibility result of Roth (1982), we formulate the mechanism design problem as a linear program that…