Sciweavers

23590 search results - page 148 / 4718
» Algorithm Performance Contest
Sort
View
HPCC
2005
Springer
14 years 2 months ago
High Performance Subgraph Mining in Molecular Compounds
Structured data represented in the form of graphs arises in several fields of the science and the growing amount of available data makes distributed graph mining techniques partic...
Giuseppe Di Fatta, Michael R. Berthold
GECCO
2004
Springer
244views Optimization» more  GECCO 2004»
14 years 2 months ago
Using Clustering Techniques to Improve the Performance of a Multi-objective Particle Swarm Optimizer
In this paper, we present an extension of the heuristic called “particle swarm optimization” (PSO) that is able to deal with multiobjective optimization problems. Our approach ...
Gregorio Toscano Pulido, Carlos A. Coello Coello
APCSAC
2000
IEEE
14 years 1 months ago
Cost/Performance Tradeoff of n-Select Square Root Implementations
Hardware square-root units require large numbers of gates even for iterative implementations. In this paper, we present four low-cost high-performance fullypipelined n-select impl...
Wanming Chu, Yamin Li
EUROMICRO
1998
IEEE
14 years 1 months ago
Process Scheduling for Performance Estimation and Synthesis of Hardware/Software Systems
The paper presents an approach to process scheduling for embedded systems. Target architectures consist of several processors and ASICs connected by shared busses. We have develop...
Petru Eles, Krzysztof Kuchcinski, Zebo Peng, Alexa...
HIS
2003
13 years 10 months ago
On the Performance of Ant-based Clustering
Ant-based clustering and sorting is a nature-inspired heuristic for general clustering tasks. It has been applied variously, from problems arising in commerce, to circuit design, t...
Julia Handl, Joshua D. Knowles, Marco Dorigo