| Parameter Self-Adaptation in an Ant Colony Algorithm for Continuous Optimization. | 1 | 0.35 | 2019 |
| Does the ACO \mathbb _R Algorithm Benefit from the Use of Crossover? | 0 | 0.34 | 2018 |
| Instance-Based Classification With Ant Colony Optimization | 2 | 0.37 | 2017 |
| A Sugeno-Based Search Width Decay Schedule In The Aco(R) Algorithm | 0 | 0.34 | 2017 |
| Integrated particle swarm and evolutionary algorithm approaches to the quadratic assignment problem | 0 | 0.34 | 2017 |
| Learning cluster-based classification systems with ant colony optimization algorithms. | 2 | 0.37 | 2017 |
| The Effect Of The Number Of Ants Parameter In The Aco(R) Algorithm: A Run-Time Profiling Study | 0 | 0.34 | 2017 |
| Solution Recombination In An Indicator-Based Many-Objective Ant Colony Optimizer For Continuous Search Spaces | 1 | 0.36 | 2017 |
| Data Reduction For Classification With Ant Colony Algorithms | 4 | 0.39 | 2016 |
| Using Ant Colony Optimization to Build Cluster-Based Classification Systems. | 2 | 0.37 | 2016 |
| An improved Particle Swarm Optimization/Tabu search approach to the Quadratic Assignment Problem | 0 | 0.34 | 2015 |
| A Gradient-Guided ACO Algorithm for Neural Network Learning | 3 | 0.38 | 2015 |
| Investigating Evaluation Measures In Ant Colony Algorithms For Learning Decision Tree Classifiers | 0 | 0.34 | 2015 |
| Learning neural network structures with ant colony algorithms | 13 | 0.58 | 2015 |
| Instance Selection with Ant Colony Optimization | 5 | 0.42 | 2015 |
| ADR-Miner: An ant-based data reduction algorithm for classification | 3 | 0.39 | 2015 |
| Advanced learning methods and exponent regularization applied to a high order neural network | 1 | 0.37 | 2014 |
| Incorporating domain-specific heuristics in a particle swarm optimization approach to the quadratic assignment problem. | 5 | 0.44 | 2014 |
| Exploring the Impact of Different Classification Quality Functions in an ACO Algorithm for Learning Neural Network Structures. | 0 | 0.34 | 2014 |
| An extended EigenAnt colony system applied to the sequential ordering problem | 0 | 0.34 | 2014 |
| A Novel Ant Colony Algorithm for Building Neural Network Topologies. | 9 | 0.50 | 2014 |
| A bare-bones ant colony optimization algorithm that performs competitively on the sequential ordering problem. | 6 | 0.50 | 2014 |
| Search Context Awareness in Several Ant Colony Optimization Models. | 0 | 0.34 | 2013 |
| Levenberg-Marquardt and Conjugate Gradient methods applied to a high-order neural network | 0 | 0.34 | 2013 |
| Utilizing multiple pheromones in an ant-based algorithm for continuous-attribute classification rule discovery. | 21 | 0.78 | 2013 |
| A less exploitative variation of the Enhanced Ant Colony System applied to SOP. | 3 | 0.39 | 2013 |
| Is there a computational advantage to representing evaporation rate in ant colony optimization as a gaussian random variable? | 3 | 0.40 | 2012 |
| Alpha-Beta Pruning And Althofer'S Pathology-Free Negamax Algorithm | 0 | 0.34 | 2012 |
| Improving the performance of MAX-MIN ant system on the TSP using stubborn ants | 5 | 0.47 | 2012 |
| Promoting Search Diversity in Ant Colony Optimization with Stubborn Ants. | 1 | 0.38 | 2012 |
| Multiple pheromone types and other extensions to the Ant-Miner classification rule discovery algorithm. | 25 | 0.85 | 2011 |
| Extensions to the ant-miner classification rule discovery algorithm | 9 | 0.59 | 2010 |
| Incorporating swarm behavior into the adaptation mechanism of an order-driven artificial financial market | 0 | 0.34 | 2009 |
| Stubborn ants. | 0 | 0.34 | 2008 |
| Finding Least Cost Proofs Using a Hierarchical PSO | 3 | 0.41 | 2007 |
| Gaussian Versus Cauchy Membership Functions in Fuzzy PSO | 1 | 0.37 | 2007 |
| A Self-Adaptive Evolutionary Algorithm Applied to Bayesian Networks | 0 | 0.34 | 2007 |
| An Evolutionary Optimization Approach To Cost-Based Abduction, With Comparison To Pso | 2 | 0.37 | 2007 |
| Exploring the fitness landscape and the run-time behaviour of an iterated local search algorithm for cost-based abduction | 3 | 0.40 | 2006 |
| Receptive field optimization for ensemble encoding | 3 | 0.49 | 2006 |
| Finding MAPs for Large Belief Networks Using Evolutionary Computation | 0 | 0.34 | 2005 |
| An efficient LP-based admissible heuristic for cost-based abduction | 1 | 0.35 | 2005 |
| Recurrent neural networks with backtrack-points and negative reinforcement applied to cost-based abduction | 6 | 0.48 | 2005 |
| Approximating cost-based abduction is NP-hard | 10 | 0.50 | 2004 |
| Abductive reasoning with recurrent neural networks | 10 | 0.54 | 2003 |
| A hybridization of Bayesian and neural learning | 3 | 0.39 | 2002 |
| A Hybrid Annealing-Neural Approach To Knowledge Discovery In Databases | 0 | 0.34 | 2001 |
| The complexity of approximating MAPs for belief networks with bounded probabilities | 3 | 0.40 | 2000 |
| Using neural network learning in an Othello evaluation function | 2 | 0.46 | 1998 |
| A Mahalanobis Distance Error Measure for Backpropagation Neural Networks | 0 | 0.34 | 1998 |
