English
Related papers

Related papers: Improved Binary Artificial Bee Colony Algorithm

200 papers

Feature selection refers to the problem of selecting relevant features which produce the most predictive outcome. In particular, feature selection task is involved in datasets containing huge number of features. Rough set theory has been…

Machine Learning · Computer Science 2010-06-24 N. Suguna , K. Thanushkodi

Computational approaches to the analysis of collective behavior in social insects increasingly rely on motion paths as an intermediate data layer from which one can infer individual behaviors or social interactions. Honey bees are a popular…

Computer Vision and Pattern Recognition · Computer Science 2018-03-16 Franziska Boenisch , Benjamin Rosemann , Benjamin Wild , Fernando Wario , David Dormagen , Tim Landgraf

Many recent statistical applications involve inference under complex models, where it is computationally prohibitive to calculate likelihoods but possible to simulate data. Approximate Bayesian Computation (ABC) is devoted to these complex…

Populations and Evolution · Quantitative Biology 2011-06-15 Katalin Csilléry , Olivier François , Michael GB Blum

Small cells have been identified as an effective solution for coping with the important traffic increase that is expected in the coming years. But this solution is accompanied by additional interference that needs to be mitigated. The…

Networking and Internet Architecture · Computer Science 2014-08-22 Abdoulaye Tall , Zwi Altman , Eitan Altman

Gathering labeled data to train well-performing machine learning models is one of the critical challenges in many applications. Active learning aims at reducing the labeling costs by an efficient and effective allocation of costly labeling…

Machine Learning · Computer Science 2020-06-03 Daniel Kottke , Marek Herde , Christoph Sandrock , Denis Huseljic , Georg Krempl , Bernhard Sick

Basic block reordering is an important step for profile-guided binary optimization. The state-of-the-art goal for basic block reordering is to maximize the number of fall-through branches. However, we demonstrate that such orderings may…

Programming Languages · Computer Science 2020-04-14 Andy Newell , Sergey Pupyrev

Evolutionary algorithms are metaheuristic techniques that derive inspiration from the natural process of evolution. They can efficiently solve (generate acceptable quality of solution in reasonable time) complex optimization (NP-Hard)…

Computer Vision and Pattern Recognition · Computer Science 2013-12-20 Anupriya Gogna , Akash Tayal

The growing complexity of real-world problems has motivated computer scientists to search for efficient problem-solving methods. Metaheuristics based on evolutionary computation and swarm intelligence are outstanding examples of…

Neural and Evolutionary Computing · Computer Science 2015-02-10 James J. Q. Yu , Victor O. K. Li

Evolutionary and bioinspired computation are crucial for efficiently addressing complex optimization problems across diverse application domains. By mimicking processes observed in nature, like evolution itself, these algorithms offer…

Neural and Evolutionary Computing · Computer Science 2025-01-14 Daniel Molina , Javier Del Ser , Javier Poyatos , Francisco Herrera

This paper proposes Genetic Algorithm with Border Trades (GAB), a novel modification of the standard genetic algorithm that enhances exploration by incorporating new chromosome patterns in the breeding process. This approach significantly…

Machine Learning · Computer Science 2025-06-27 Qingchuan Lyu

This paper proposes a modification to the traditional binary search algorithm in which it checks the presence of the input element with the middle element of the given set of elements at each iteration. Modified binary search algorithm…

Data Structures and Algorithms · Computer Science 2014-06-09 Ankit R. Chadha , Rishikesh Misal , Tanaya Mokashi

Nature-inspired algorithms are among the most powerful algorithms for optimization. In this study, a new nature-inspired metaheuristic optimization algorithm, called bat algorithm (BA), is introduced for solving engineering optimization…

Optimization and Control · Mathematics 2012-11-29 Xin-She Yang , Amir H. Gandomi

We propose a novel use of a recent new computational tool for Bayesian inference, namely the Approximate Bayesian Computation (ABC) methodology. ABC is a way to handle models for which the likelihood function may be intractable or even…

Computation · Statistics 2014-03-04 Clara Grazian , Brunero Liseo

Approximate Bayesian Computation (ABC) methods are used to approximate posterior distributions in models with unknown or computationally intractable likelihoods. Both the accuracy and computational efficiency of ABC depend on the choice of…

Methodology · Statistics 2017-03-17 Bai Jiang , Tung-yu Wu , Charles Zheng , Wing H. Wong

Approximate Bayesian Computation (ABC) has become increasingly prominent as a method for conducting parameter inference in a range of challenging statistical problems, most notably those characterized by an intractable likelihood function.…

Swarm intelligence optimization algorithms can be adopted in swarm robotics for target searching tasks in a 2-D or 3-D space by treating the target signal strength as fitness values. Many current works in the literature have achieved good…

Neural and Evolutionary Computing · Computer Science 2021-05-28 Jian Yang , Yuhui Shi

In the quest to harness the power of quantum computing, training quantum neural networks (QNNs) presents a formidable challenge. This study introduces an innovative approach, integrating the Bees Optimization Algorithm (BOA) to overcome one…

Quantum Physics · Physics 2024-08-19 Rubén Darío Guerrero

Understanding how genetically encoded rules drive and guide complex neuronal growth processes is essential to comprehending the brain's architecture, and agent-based models (ABMs) offer a powerful simulation approach to further develop this…

Computational Engineering, Finance, and Science · Computer Science 2024-05-24 Tobias Duswald , Lukas Breitwieser , Thomas Thorne , Barbara Wohlmuth , Roman Bauer

We develop algorithms capable of tackling robust black-box optimisation problems, where the number of model runs is limited. When a desired solution cannot be implemented exactly the aim is to find a robust one, where the worst case in an…

Optimization and Control · Mathematics 2020-04-17 Martin Hughes , Marc Goerigk , Trivikram Dokka

Approximate Bayesian computation (ABC) methods, which are applicable when the likelihood is difficult or impossible to calculate, are an active topic of current research. Most current ABC algorithms directly approximate the posterior…

Computation · Statistics 2012-12-10 Y. Fan , D. J. Nott , S. A. Sisson
‹ Prev 1 8 9 10 Next ›