Sciweavers

2657 search results - page 107 / 532
» On the complexity of hierarchical problem solving
Sort
View
GECCO
2007
Springer
138views Optimization» more  GECCO 2007»
15 years 7 months ago
Reducing the space-time complexity of the CMA-ES
A limited memory version of the covariance matrix adaptation evolution strategy (CMA-ES) is presented. This algorithm, L-CMA-ES, improves the space and time complexity of the CMA-...
James N. Knight, Monte Lunacek
WSC
2004
15 years 2 months ago
A Probabilistic Total System Approach to the Simulation of Complex Environmental Systems
GoldSim is a powerful and flexible Windows-based computer program for carrying out probabilistic simulations of complex systems to support management and decisionmaking in enginee...
Rick Kossik, Ian Miller
COMPUTING
2008
174views more  COMPUTING 2008»
15 years 1 months ago
Multilevel algorithms for Rannacher-Turek finite element approximation of 3D elliptic problems
Generalizing the approach of a previous work [15] the authors present multilevel preconditioners for three-dimensional (3D) elliptic problems discretized by a family of Rannacher ...
Ivan Georgiev, Johannes Kraus, Svetozar Margenov
ATAL
2003
Springer
15 years 6 months ago
Agent network topology and complexity
In this paper, we examine two multi-agent based representations of SATs and further experimentally study the topologies of resulting agent networks. We show that different repres...
Xiaolong Jin, Jiming Liu
CORR
2010
Springer
147views Education» more  CORR 2010»
15 years 4 days ago
Strong direct product theorems for quantum communication and query complexity
A strong direct product theorem (SDPT) states that solving n instances of a problem requires ˝.n/ times the resources for a single instance, even to achieve success probability 2 ...
Alexander A. Sherstov