Related papers: Heuristic for Maximizing Grouping Efficiency in th…
During development, highly ordered structures emerge as cells collectively coordinate with each other. While recent advances have clarified how individual cells process and respond to external signals, understanding collective cellular…
Combinatorial optimization is frequently used in computer vision. For instance, in applications like semantic segmentation, human pose estimation and action recognition, programs are formulated for solving inference in Conditional Random…
The team formation and routing problem is a challenging optimization problem with several real-world applications in fields such as airport, healthcare, and maintenance operations. To solve this problem, exact solution methods based on…
The objective is to find a Cellular Automata rule that can form a 2D point pattern with a maximum number of points (1-cells). Points are not allowed to touch each other, they have to be separated by 0-cells, and every 0-cell can find at…
The Unit Commitment problem with AC power flow constraints (UC-ACOPF) is a non-convex mixed-integer nonlinear programming (MINLP) problem encountered in power systems. Its combination of combinatorial complexity and non-convex nonlinear…
Stochastic fluctuations of molecular abundances are a ubiquitous feature of cellular processes and lead to significant cell-to-cell variability. Recent theoretical work established lower bounds for stochastic fluctuations in cells for broad…
This two-part paper explores the use of FP in the design and optimization of communication systems. Part I of this paper focuses on FP theory and on solving continuous problems. The main theoretical contribution is a novel quadratic…
Heuristic design with large language models (LLMs) has emerged as a promising approach for tackling combinatorial optimization problems (COPs). However, existing approaches often rely on manually predefined evolutionary computation (EC)…
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…
In the present work, we investigate the computational efficiency afforded by higher-order finite-element discretization of the saddle-point formulation of orbital-free density functional theory. We first investigate the robustness of viable…
In recent years generative design techniques have become firmly established in numerous applied fields, especially in engineering. These methods are demonstrating intensive growth owing to promising outlook. However, existing approaches are…
The manpower scheduling problem is a critical research field in the resource management area. Based on the existing studies on scheduling problem solutions, this paper transforms the manpower scheduling problem into a combinational…
The linked cell list algorithm is an essential part of molecular simulation software, both molecular dynamics and Monte Carlo. Though it scales linearly with the number of particles, there has been a constant interest in increasing its…
We investigate the statistical mechanics of glass-forming materials and jamming matter by means of a geometrically driven approach based on a revised cell theory. By considering the system as constituted of jammed blocks of increasing…
We present a systematic, algebraically based, design methodology for efficient implementation of computer programs optimized over multiple levels of the processor/memory and network hierarchy. Using a common formalism to describe the…
Modularity is one of the most widely used quality measures for graph clusterings. Maximizing modularity is NP-hard, and the runtime of exact algorithms is prohibitive for large graphs. A simple and effective class of heuristics coarsens the…
In intensity-modulated radiation therapy, optimal intensity distributions of incoming beams are decomposed into linear combinations of leaf openings of a multileaf collimator (segments). In order to avoid inefficient dose delivery, the…
We answer the questions of the high-order technology focus group (HO-TFG) about the mesh generation for the high-lift common research model of the 4-th high-lift prediction workshop. The HO-TFG seeks answers about the feasibility of…
Unsplittable flow problems cover a wide range of telecommunication and transportation problems and their efficient resolution is key to a number of applications. In this work, we study algorithms that can scale up to large graphs and…
We propose a new multi-scale molecular dynamics simulation method which can achieve high accuracy and high sampling efficiency simultaneously without aforehand knowledge of the coarse grained (CG) potential and test it for a biomolecular…