Sciweavers

9736 search results - page 34 / 1948
» How Fast Can We Compute Products
Sort
View
VALUETOOLS
2006
ACM
176views Hardware» more  VALUETOOLS 2006»
15 years 10 months ago
How to solve large scale deterministic games with mean payoff by policy iteration
Min-max functions are dynamic programming operators of zero-sum deterministic games with finite state and action spaces. The problem of computing the linear growth rate of the or...
Vishesh Dhingra, Stephane Gaubert
IEEECIT
2009
IEEE
15 years 11 months ago
Dynamic Software Product Lines for Service-Based Systems
—Ageing populations and the necessity to reduce environmental impact raise new challenges on our living buildings. Convergence of home control systems (air conditioning, light ma...
Paul Istoan, Grégory Nain, Gilles Perrouin,...
PEPM
2010
ACM
16 years 1 months ago
Optimizing relational algebra operations using generic equivalence discriminators and lazy products
We show how to efficiently evaluate generic map-filter-product queries, generalizations of select-project-join (SPJ) queries in relational algebra, based on a combination of two...
Fritz Henglein
PROCEDIA
2010
97views more  PROCEDIA 2010»
15 years 2 months ago
Ontological musings on how nature computes
Modern physical theory and modern computational techniques are used to provide conjecture on how nature computes. I utilize time-domain simulation of physical phenomena and build ...
J. F. Nystrom
NIPS
2001
15 years 5 months ago
Fast, Large-Scale Transformation-Invariant Clustering
In previous work on "transformed mixtures of Gaussians" and "transformed hidden Markov models", we showed how the EM algorithm in a discrete latent variable mo...
Brendan J. Frey, Nebojsa Jojic