21 papers · ranked by Valyu relevance
Eliézer Béczi, Noémi Gaskó, Lisu Yu
Determining the critical nodes in a complex network is an essential computation problem. Several variants of this problem have emerged due to its wide applicability in network analysis. In this article we study the bi-objective critical node detection problem (BOCNDP), which is a new variant of the well-known critical…
Mengyu Huang, Yuxing Zhong, Huiwen Yang, Jiazheng Wang + 3 more
'Bo Bai' 'Ling Shi'] The simplex method is one of the most fundamental technologies for solving linear programming (LP) problems and has been widely applied to different practical applications. In the past literature, how to improve and accelerate the simplex method has attracted plenty of research. One important way…
João Fé, Sérgio D. Correia, Slavisa Tomic, Marko Beko + 1 more
'Paolo Bellavista'] In the last decades, several swarm-based optimization algorithms have emerged in the scientific literature, followed by a massive increase in terms of their fields of application. Most of the studies and comparisons are restricted to high-level languages (such as MATLAB®) and testing methods on…
Abdesslem Layeb
This paper presents two novel deterministic initialization procedures for K-means clustering based on a modified crowding distance. The procedures, named CKmeans and FCKmeans, use more crowded points as initial centroids. Experimental studies on multiple datasets demonstrate that the proposed approach outperforms…
Lexin Chen, Daniel R. Roe, Matthew Kochert, Carlos Simmerling + 1 more
One of the key challenges of k-means clustering is the seed selection or the initial centroid estimation since the clustering result depends heavily on this choice. Alternatives such as k-means++ have mitigated this limitation by estimating the centroids using an empirical probability distribution. However, with…
Verusca Severo, Felipe B. S. Ferreira, Rodrigo Spencer, Arthur Nascimento + 2 more
'Arthur Nascimento' 'Francisco Madeiro' 'Steve Vanlanduit'] Vector Quantization (VQ) is a technique with a wide range of applications. For example, it can be used for image compression. The codebook design for VQ has great significance in the quality of the quantized signals and can benefit from the use of swarm…
Kaiyuan Zheng, Huiyong Liu, Bopeng Li
In engineering applications, many complex problems can be formulated as mathematical optimization challenges, and efficiently solving these problems is critical. Metaheuristic algorithms have proven highly effective in addressing a wide range of engineering issues. The Snake Optimization Algorithm (SO) is a novel…
Yuyong Tan, Jianfeng Wang, Bin Wang, Yongquan Zhou
The intelligent optimization algorithm has become a key tool in complex and intertwined engineering and science fields. However, with the increasing complexity of the problem and the rapid expansion of the data scale, the performance of the algorithm has been challenged unprecedentedly. The artificial lemming algorithm…
Pankaj Sharma, Rohit Salgotra, Saravanakumar Raju, Mohamed Abouhawwash + 1 more
'Mohamed Abouhawwash' 'S. S. Askar'] This paper presents a study to enhance the performance of a recently introduced naked mole-rat algorithm (NMRA), by local optima avoidance, and better exploration as well as exploitation properties. A new set of algorithms, namely Prairie dog optimization algorithm, INFO, and…
Authors not listed
With the ever-increasing demand for atomistic structures representative of real-life systems as well as the ad-vent of exascale computers, it has now become necessary and possible to use advanced global optimization (GO) techniques to intelligently sample the potential energy surface (PES). Given the previous studies…
Marius Pachitariu, Lin Zhong, Alexa Gracias, Amanda Minisi + 2 more
Artificial neural networks learn faster if they are initialized well. Good initializations can generate high-dimensional macroscopic dynamics with long timescales. It is not known if biological neural networks have similar properties. Here we show that the eigenvalue spectrum and dynamical properties of large-scale…
Neha Vinayak, Shandar Ahmad
A multi-layer perceptron (MLP) consists of a number of forward-connected weights (W_ijk_) from each feeding layer node (n_ij_) to the many initially equivalent nodes (n_i+1,k_) in the next layer. Exact a priori order and search space of these weights (W_ijk_) is random and prone to redundancy, irreproducibility and…
Mohammed Baragilly, Brian H Willis
Meta-analysis may be used to summarise a test’s accuracy. Often the sensitivity and specificity are the measures of interest and as these are correlated a bivariate random effects model is commonly used to fit the data. This model has five parameters and it may be optimised using a Newton-Raphson based algorithm…
Authors not listed
Data-driven approaches offer great potential for accelerating ab initio electronic structure calculations of molecules and materials but their transferability is often limited due to the vast amount of data needed for training, including when addressing the need to fine-tune universal models for each specific system to…
Authors not listed
Quantum mechanics/molecular mechanics (QM/MM) simulations are crucial for understanding enzymatic reactions, but their accuracy depends heavily on the quantum-mechanical method used. Semiempirical methods offer computational efficiency but often struggle with accuracy in complex systems. This work presents a novel…
Giorgio Grani, Corrado Coppola, Valerio Agasucci
This work describes PUSH, a primal heuristic combining Feasibility Pump and Shifting. The main idea is to replace the rounding phase of the Feasibility Pump with a suitable adaptation of the Shifting and other rounding heuristics. The algorithm presents different strategies, depending on the nature of the partial…
Authors not listed
This study presents a novel application of Multi-Objective Bayesian Optimization (MOBO) to enhance the formulation of flame-retardant polypropylene (PP) composites. Our goal was to optimize the chemical composition of intumescent polypropylene (PP) formulations by maximizing the Limiting Oxygen Index (LOI) and…
M.Z. Naser, Abdallah Naser
Problems Authors: ['M.Z. Naser' 'Abdallah Naser'] This paper presents the Firefighter Optimization (FFO) algorithm as a new hybrid metaheuristic for optimization problems. This algorithm stems inspiration from the collaborative strategies often deployed by firefighters in firefighting activities. To evaluate the…
Karthik Reddy Kanjula, Sai Meghana Kolla
This paper presents the development of a distributed application that facilitates the understanding and application of swarm intelligence in solving optimization problems. The platform comprises a search space of customizable random particles, allowing users to tailor the solution to their specific needs. By leveraging…
Antônio Augusto Chaves, Maurício G. C. Resende, Ricardo M. A. Silva
This paper proposes a problem-independent GRASP metaheuristic using the random-key optimizer (RKO) paradigm. GRASP (greedy randomized adaptive search procedure) is a metaheuristic for combinatorial optimization that repeatedly applies a semi-greedy construction procedure followed by a local search procedure. The best…
Koichi Miyamoto, Naoki Yamamoto, Yasubumi Sakakibara
We propose two quantum algorithms for a problem in bioinformatics, position weight matrix (PWM) matching, which aims to find segments (sequence motifs) in a biological sequence such as DNA and protein that have high scores defined by the PWM and are thus of informational importance related to biological function. The…