Sciweavers

74 search results - page 10 / 15
» Infinite Time Register Machines
Sort
View
TLCA
2007
Springer
14 years 1 months ago
Predicative Analysis of Feasibility and Diagonalization
Abstract. Predicative analysis of recursion schema is a method to characterize complexity classes like the class of polynomial time functions. This analysis comes from the works of...
Jean-Yves Marion
ISCA
2011
IEEE
271views Hardware» more  ISCA 2011»
12 years 11 months ago
CRIB: consolidated rename, issue, and bypass
Conventional high-performance processors utilize register renaming and complex broadcast-based scheduling logic to steer instructions into a small number of heavily-pipelined exec...
Erika Gunadi, Mikko H. Lipasti
ICML
2005
IEEE
14 years 8 months ago
Bayesian hierarchical clustering
We present a novel algorithm for agglomerative hierarchical clustering based on evaluating marginal likelihoods of a probabilistic model. This algorithm has several advantages ove...
Katherine A. Heller, Zoubin Ghahramani
FUIN
2006
85views more  FUIN 2006»
13 years 7 months ago
Decidability and Universality in Symbolic Dynamical Systems
Many different definitions of computational universality for various types of dynamical systems have flourished since Turing's work. We propose a general definition of univers...
Jean-Charles Delvenne, Petr Kurka, Vincent D. Blon...
COLT
2010
Springer
13 years 5 months ago
Open Loop Optimistic Planning
We consider the problem of planning in a stochastic and discounted environment with a limited numerical budget. More precisely, we investigate strategies exploring the set of poss...
Sébastien Bubeck, Rémi Munos