Sciweavers

2080 search results - page 52 / 416
» Measuring empirical computational complexity
Sort
View
CIE
2005
Springer
14 years 3 months ago
Complexity of Continuous Space Machine Operations
We investigate the computational complexity of an optical model of computation called the continuous space machine (CSM). We characterise worst case resource growth over time for e...
Damien Woods, J. Paul Gibson
CCGRID
2007
IEEE
14 years 4 months ago
Profiling Computation Jobs in Grid Systems
The existence of good probabilistic models for the job arrival process and job characteristics is important for the improved understanding of grid systems and the prediction of th...
Michael Oikonomakos, Kostas Christodoulopoulos, Em...
IJAR
2010
106views more  IJAR 2010»
13 years 8 months ago
A minimum distance estimator in an imprecise probability model - Computational aspects and applications
The present article considers estimating a parameter θ in an imprecise probability model (Pθ)θ∈Θ which consists of coherent upper previsions Pθ . After the definition of a...
Robert Hable
MFCS
2010
Springer
13 years 8 months ago
Parity Games with Partial Information Played on Graphs of Bounded Complexity
Abstract. We address the strategy problem for parity games with partial information and observable colors, played on finite graphs of bounded graph complexity. We consider several...
Bernd Puchala, Roman Rabinovich
CHI
2003
ACM
14 years 10 months ago
Simple cognitive modeling in a complex cognitive architecture
Cognitive modeling has evolved into a powerful tool for understanding and predicting user behavior. Higher-level modeling frameworks such as GOMS and its variants facilitate fast ...
Dario D. Salvucci, Frank J. Lee