Sciweavers

8196 search results - page 143 / 1640
» Computational Modeling and Complexity Science
Sort
View
ICML
2009
IEEE
15 years 4 months ago
Active learning for directed exploration of complex systems
Physics-based simulation codes are widely used in science and engineering to model complex systems that would be infeasible to study otherwise. Such codes provide the highest-fid...
Michael C. Burl, Esther Wang
SAGA
2007
Springer
15 years 4 months ago
On Computation and Communication with Small Bias
We present two results for computational models that allow error probabilities close to 1/2. First, most computational complexity classes have an analogous class in communication ...
Harry Buhrman
STACS
2010
Springer
15 years 5 months ago
Reflections on Multivariate Algorithmics and Problem Parameterization
Research on parameterized algorithmics for NP-hard problems has steadily grown over the last years. We survey and discuss how parameterized complexity analysis naturally develops i...
Rolf Niedermeier
TCS
2011
14 years 5 months ago
Communication complexity and intrinsic universality in cellular automata
Let F be a cellular automaton (CA). This paper establishes necessary conditions for F in order to be intrinsically universal. The central idea is to consider the communication com...
Eric Goles Chacc, Pierre-Etienne Meunier, Ivan Rap...
MCU
2007
95views Hardware» more  MCU 2007»
14 years 11 months ago
Slightly Beyond Turing's Computability for Studying Genetic Programming
Inspired by genetic programming (GP), we study iterative algorithms for non-computable tasks and compare them to naive models. This framework justifies many practical standard tri...
Olivier Teytaud