Related papers: Climbing on Pyramids
In blackbox optimization, evaluation of the objective and constraint functions is time consuming. In some situations, constraint values may be evaluated independently or sequentially. The present work proposes and compares two strategies to…
Several algorithms have been proposed to compute partitions of networks into communities that score high on a graph clustering index called modularity. While publications on these algorithms typically contain experimental evaluations to…
The determination of environmentally- and economically-optimal energy system designs and operations is complex. In particular, the integration of weather-dependent renewable energy technologies into energy system optimization models…
The ecologist H. T. Odum introduced a principle of physics, called Maximum Empower, in order to explain self-organization in a system (e.g. physical, biological, social, economical, mathematical, ...). The concept of empower relies on…
Understanding the context of complex and cluttered scenes is a challenging problem for semantic segmentation. However, it is difficult to model the context without prior and additional supervision because the scene's factors, such as the…
We present a mathematical model for optimizing breakaway strategies in competitive cycling, balancing power expenditure, aerodynamic drag, and crashing. Our framework incorporates probabilistic crash dynamics, allowing a cyclist's risk…
A perfectly rational decision-maker chooses the best action with the highest utility gain from a set of possible actions. The optimality principles that describe such decision processes do not take into account the computational costs of…
Alternative novel measures of the distance between any two partitions of a n-set are proposed and compared, together with a main existing one, namely 'partition-distance' D(.,.). The comparison achieves by checking their restriction to…
We present a rigorous approach, based on the concept of continuous thermomajorisation, to algorithmically characterise the full set of energy occupations of a quantum system accessible from a given initial state through weak interactions…
We report a study of the basins of attraction for potential energy minima defined by different minimisation algorithms for an atomic system. We find that whereas some minimisation algorithms produce compact basins, others produce basins…
Our work is an approach between matter and energy. Using the famous equation E = mc^2, Einstein and the Law of Universal Gravitation of Newton, we estimate that a small amount matter converted into energy is needed to lift, using the…
We consider a \emph{Social Group} of networked nodes, seeking a "universe" of segments for maximization of their utility. Each node has a subset of the universe, and access to an expensive link for downloading data. Nodes can also acquire…
Hierarchical clustering is a critical task in numerous domains. Many approaches are based on heuristics and the properties of the resulting clusterings are studied post hoc. However, in several applications, there is a natural cost function…
This article attempts answering the following problematic: How to model and classify energy consumption profiles over a large distributed territory to optimize the management of buildings' consumption? Doing case-by-case in depth auditing…
The paper considers the minimization of a separable convex function subject to linear ascending constraints. The problem arises as the core optimization in several resource allocation scenarios, and is a special case of an optimization of a…
Hierarchical learning algorithms that gradually approximate a solution to a data-driven optimization problem are essential to decision-making systems, especially under limitations on time and computational resources. In this study, we…
We investigate a new model for partitioning a set of items into groups (clusters). The number of groups is given and the distances between items are well defined. These distances may include weights. The sum of the distances between all…
Motivated by the development of computer theory, the sorting algorithm is emerging in an endless stream. Inspired by decrease and conquer method, we propose a brand new sorting algorithmUltimately Heapsort. The algorithm consists of two…
This paper deals with energy management in a district where multiple buildings can communicate over a time-varying network and aim at optimizing the use of shared resources like storage systems. We focus on building cooling, and propose an…
We present a family of high-order finite element approximation spaces on a pyramid, and associated unisolvent degrees of freedom. These spaces consist of rational basis functions. We establish conforming, exactness and polynomial…