Sciweavers

17541 search results - page 3115 / 3509
» Complexity in scalable computing
Sort
View
351
Voted
ECAI
2010
Springer
15 years 8 months ago
Bayesian Monte Carlo for the Global Optimization of Expensive Functions
In the last decades enormous advances have been made possible for modelling complex (physical) systems by mathematical equations and computer algorithms. To deal with very long run...
Perry Groot, Adriana Birlutiu, Tom Heskes
193
Voted
DAIS
2008
15 years 8 months ago
Using Object Replication for Building a Dependable Version Control System
Object-oriented technologies are frequently used to design and implement distributed applications. Object replication is a well-established approach to increase the dependability f...
Rüdiger Kapitza, Peter Baumann, Hans P. Reise...
167
Voted
FSTTCS
2008
Springer
15 years 8 months ago
Graph Games on Ordinals
We consider an extension of Church’s synthesis problem to ordinals by adding limit transitions to graph games. We consider game arenas where these limit transitions are defined...
Julien Cristau, Florian Horn
208
Voted
GECCO
2008
Springer
174views Optimization» more  GECCO 2008»
15 years 8 months ago
Mask functions for the symbolic modeling of epistasis using genetic programming
The study of common, complex multifactorial diseases in genetic epidemiology is complicated by nonlinearity in the genotype-to-phenotype mapping relationship that is due, in part,...
Ryan J. Urbanowicz, Nate Barney, Bill C. White, Ja...
185
Voted
GECCO
2008
Springer
124views Optimization» more  GECCO 2008»
15 years 8 months ago
Runtime analysis of binary PSO
We investigate the runtime of the Binary Particle Swarm Optimization (PSO) algorithm introduced by Kennedy and Eberhart (1997). The Binary PSO maintains a global best solution and...
Dirk Sudholt, Carsten Witt
« Prev « First page 3115 / 3509 Last » Next »