Sciweavers

659 search results - page 36 / 132
» Data mining with an ant colony optimization algorithm
Sort
View
HEURISTICS
2006
120views more  HEURISTICS 2006»
15 years 3 months ago
A study of ACO capabilities for solving the maximum clique problem
This paper investigates the capabilities of the Ant Colony Optimization (ACO) meta-heuristic for solving the maximum clique problem, the goal of which is to find a largest set of ...
Christine Solnon, Serge Fenet
ADBIS
2004
Springer
133views Database» more  ADBIS 2004»
15 years 8 months ago
Evaluation of the Mine-Merge Method for Data Mining Query Processing
In this paper we consider concurrent execution of multiple data mining queries in the context of discovery of frequent itemsets. If such data mining queries operate on similar part...
Marek Wojciechowski, Maciej Zakrzewicz
118
Voted
DATE
2008
IEEE
107views Hardware» more  DATE 2008»
15 years 9 months ago
Instruction Set Extension Exploration in Multiple-Issue Architecture
To satisfy high-performance computing demand in modern embedded devices, current embedded processor architectures provide designer with possibility either to define customized ins...
I-Wei Wu, Zhi-Yuan Chen, Jean Jyh-Jiun Shann, Chun...
ATAL
2004
Springer
15 years 8 months ago
A Pheromone-Based Utility Model for Collaborative Foraging
Multi-agent research often borrows from biology, where remarkable examples of collective intelligence may be found. One interesting example is ant colonies’ use of pheromones as...
Liviu Panait, Sean Luke
140
Voted
GECCO
2006
Springer
151views Optimization» more  GECCO 2006»
15 years 7 months ago
Neighbourhood searches for the bounded diameter minimum spanning tree problem embedded in a VNS, EA, and ACO
We consider the Bounded Diameter Minimum Spanning Tree problem and describe four neighbourhood searches for it. They are used as local improvement strategies within a variable nei...
Martin Gruber, Jano I. van Hemert, Günther R....