Sciweavers

15494 search results - page 2762 / 3099
» Computing dynamic clusters
Sort
View
GECCO
2009
Springer
124views Optimization» more  GECCO 2009»
16 years 1 months ago
Three interconnected parameters for genetic algorithms
When an optimization problem is encoded using genetic algorithms, one must address issues of population size, crossover and mutation operators and probabilities, stopping criteria...
Pedro A. Diaz-Gomez, Dean F. Hougen
LION
2009
Springer
160views Optimization» more  LION 2009»
16 years 1 months ago
Corridor Selection and Fine Tuning for the Corridor Method
In this paper we present a novel hybrid algorithm, in which ideas from the genetic algorithm and the GRASP metaheuristic are cooperatively used and intertwined to dynamically adjus...
Marco Caserta, Stefan Voß
192
Voted
NOSSDAV
2009
Springer
16 years 1 months ago
A delaunay triangulation architecture supporting churn and user mobility in MMVEs
This article proposes a new distributed architecture for update message exchange in massively multi-user virtual environments (MMVE). MMVE applications require delivery of updates...
Mohsen Ghaffari, Behnoosh Hariri, Shervin Shirmoha...
NOSSDAV
2009
Springer
16 years 1 months ago
Power efficient real-time disk scheduling
Hard-disk drive power consumption reduction methods focus mainly on increasing the amount of time the disk is in standby mode (disk spun down) by implementing aggressive data read...
Damien Le Moal, Donald Molaro, Jorge Campello
PKDD
2009
Springer
102views Data Mining» more  PKDD 2009»
16 years 1 months ago
Relevance Grounding for Planning in Relational Domains
Probabilistic relational models are an efficient way to learn and represent the dynamics in realistic environments consisting of many objects. Autonomous intelligent agents that gr...
Tobias Lang, Marc Toussaint
« Prev « First page 2762 / 3099 Last » Next »