Sciweavers

1830 search results - page 177 / 366
» Optimizing Sorting with Genetic Algorithms
Sort
View
GECCO
2005
Springer
115views Optimization» more  GECCO 2005»
15 years 8 months ago
Search-based improvement of subsystem decompositions
The subsystem decomposition of a software system degrades gradually during its lifetime and therefore it gets harder and harder to maintain. As a result this decomposition needs t...
Olaf Seng, Markus Bauer, Matthias Biehl, Gert Pach...
CCE
2005
15 years 2 months ago
Use of parallel computers in rational design of redundant sensor networks
A general method to design optimal redundant sensor network even in the case of one sensor failure and able to estimate process key parameters within a required accuracy is propos...
Carine Gerkens, Georges Heyen
130
Voted
SIGMOD
1996
ACM
120views Database» more  SIGMOD 1996»
15 years 7 months ago
Query Execution Techniques for Caching Expensive Methods
Object-Relational and Object-Oriented DBMSs allow users to invoke time-consuming ("expensive") methods in their queries. When queries containing these expensive methods a...
Joseph M. Hellerstein, Jeffrey F. Naughton
GECCO
2008
Springer
124views Optimization» more  GECCO 2008»
15 years 3 months ago
Introducing MONEDA: scalable multiobjective optimization with a neural estimation of distribution algorithm
In this paper we explore the model–building issue of multiobjective optimization estimation of distribution algorithms. We argue that model–building has some characteristics t...
Luis Martí, Jesús García, Ant...
AEI
2005
99views more  AEI 2005»
15 years 2 months ago
Comparison among five evolutionary-based optimization algorithms
Evolutionary algorithms (EAs) are stochastic search methods that mimic the natural biological evolution and/or the social behavior of species. Such algorithms have been developed ...
Emad Elbeltagi, Tarek Hegazy, Donald E. Grierson