Sciweavers

188 search results - page 9 / 38
» Back to the Complexity of Universal Programs
Sort
View
AGI
2008
13 years 8 months ago
A computational approximation to the AIXI model
Universal induction solves in principle the problem of choosing a prior to achieve optimal inductive inference. The AIXI theory, which combines control theory and universal induct...
Sergey Pankov
IGPL
2011
13 years 2 months ago
J-MADeM, a market-based model for complex decision problems
This paper presents J-MADeM, a multi-modal decision making mechanism to provide agents in a Multi-Agent Systems (MAS) with a market-based model for complex decision problems. J-MA...
Francisco Grimaldo, Miguel Lozano, Fernando Barber
FATES
2006
Springer
13 years 11 months ago
Model-Based Testing of Thin-Client Web Applications
Abstract. More and more software systems use a browser as the universal graphical user interface. As a consequence these applications inherit browser navigation as part of their in...
Pieter W. M. Koopman, Rinus Plasmeijer, Peter Acht...
PLDI
2009
ACM
14 years 2 months ago
Binary analysis for measurement and attribution of program performance
Modern programs frequently employ sophisticated modular designs. As a result, performance problems cannot be identified from costs attributed to routines in isolation; understand...
Nathan R. Tallent, John M. Mellor-Crummey, Michael...
EUROPAR
2004
Springer
13 years 11 months ago
Imprecise Exceptions in Distributed Parallel Components
Abstract. Modern microprocessors have sacrificed the exactness of exceptions for improved performance long ago. This is a side effect of reordering instructions so that the micropr...
Kostadin Damevski, Steven G. Parker