Related papers: Climbing on Pyramids
With the advent of prosumers, the traditional centralized operation may become impracticable due to computational burden, privacy concerns, and conflicting interests. In this paper, an energy sharing mechanism is proposed to accommodate…
It is required to find an optimal order of constructing the edges of a network so as to minimize the sum of the weighted connection times of relevant pairs of vertices. Construction can be performed anytime anywhere in the network, with a…
The principle of hierarchical design is a prominent theme in many natural systems where mechanical efficiency is of importance. Here we establish the properties of a particular hierarchical structure, showing that high mechanical efficiency…
Steepest-entropy-ascent quantum thermodynamics, or SEAQT, is a unified approach of quantum mechanics and thermodynamics that avoids many of the inconsistencies that can arise between the two theories. Given a set of energy levels, i.e.,…
Clustering is often used for discovering structure in data. Clustering systems differ in the objective function used to evaluate clustering quality and the control strategy used to search the space of clusterings. Ideally, the search…
The method for analyzing algorithmic runtime complexity using decision trees is discussed using the sorting algorithm. This method is then extended to optimal algorithms which may find all cliques of size q in network N, or simply the first…
Many interesting computational problems can be reformulated in terms of decision trees. A natural classical algorithm is to then run a random walk on the tree, starting at the root, to see if the tree contains a node n levels from the root.…
We show that the time dependence of mean value of a physical quantity is related with the transition energies of a quantum system. In the case when the operator of a physical quantity anticommutes with the Hamiltonian of a system, studies…
We consider the physical situations where the resource theories of coherence and thermodynamics play competing roles. In particular, we study the creation of quantum coherence using unitary operations with limited thermodynamic resources.…
The problem of attaining energy efficiency in distributed systems is of importance, but a general, non-domain-specific theory of energy-minimal scheduling is far from developed. In this paper, we classify the problems of energy-minimal…
Hierarchical structures are ubiquitous in human and animal societies, but a fundamental understanding of their raison d'\^etre has been lacking. Here, we present a general theory in which hierarchies are obtained as the optimal design that…
We derive and investigate lower bounds for the potential energy of finite spherical point sets (spherical codes). Our bounds are optimal in the following sense -- they cannot be improved by employing polynomials of the same or lower degrees…
We propose a general-purpose method for finding high-quality solutions to hard optimization problems, inspired by self-organizing processes often found in nature. The method, called Extremal Optimization, successively eliminates extremely…
Many optimization problems admit a number of local optima, among which there is the global optimum. For these problems, various heuristic optimization methods have been proposed. Comparing the results of these solvers requires the…
Optimization of power distribution system topology is complicated by the requirement that the system be operated in a radial configuration. In this paper, we discuss existing methods for enforcing radiality constraints and introduce two new…
The ultimate limits of computation are not just logical, but physical. We investigate the physical resources -- time, energy, entropy, and free energy -- required to perform computational work. We apply the resulting measures of physical…
There is evidence that the self-assembly of complex molecular systems often proceeds hierarchically, by first building subunits that later assemble in larger entities, in a process that can repeat multiple times. Yet, our understanding of…
We introduce a framework for incremental-decremental maximization that captures the gradual transformation or renewal of infrastructures. In our model, an initial solution is transformed one element at a time and the utility of an…
The efficiency of a large hierarchical organisation is simulated on Barabasi-Albert networks, when each needed link leads to a loss of information. The optimum is found at a finite network size, corresponding to about five hierarchical…
We develop an approach for solving rooted orienteering problems with category constraints as found in tourist trip planning and logistics. It is based on expanding partial solutions in a systematic way, prioritizing promising ones, which…