Sciweavers

28888 search results - page 66 / 5778
» Computability and complexity in analysis
Sort
View
CEC
2010
IEEE
13 years 9 months ago
An analysis of massively distributed evolutionary algorithms
Computational science is placing new demands on optimization algorithms as the size of data sets and the computational complexity of scientific models continue to increase. As thes...
Travis J. Desell, David P. Anderson, Malik Magdon-...
ATAL
2008
Springer
13 years 10 months ago
Selecting strategies using empirical game models: an experimental analysis of meta-strategies
In many complex multi-agent domains it is impractical to compute exact analytic solutions. An alternate means of analysis applies computational tools to derive and analyze empiric...
Christopher Kiekintveld, Michael P. Wellman
HCW
2000
IEEE
14 years 10 days ago
Heterogeneity as Key Feature of High Performance Computing: the PQE1 Prototype
In this work we present the results of a project aimed at assembling an hybrid massively parallel machine, the PQE1 prototype, devoted to the simulation of complex physical models...
Paolo Palazzari, Lidia Arcipiani, Massimo Celino, ...
CACM
2007
164views more  CACM 2007»
13 years 8 months ago
Is abstraction the key to computing?
ACTION THE KEY TO COMPUTING? Why is it that some software engineers and computer scientists are able to produce clear, elegant designs and programs, while others cannot? Is it poss...
Jeff Kramer
COCO
2009
Springer
121views Algorithms» more  COCO 2009»
14 years 2 months ago
Lower Bounds on Quantum Multiparty Communication Complexity
A major open question in communication complexity is if randomized and quantum communication are polynomially related for all total functions. So far, no gap larger than a power o...
Troy Lee, Gideon Schechtman, Adi Shraibman