Sciweavers

29082 search results - page 84 / 5817
» The Time-Triggered Model of Computation
Sort
View
CIE
2010
Springer
14 years 27 days ago
On the Completeness of Quantum Computation Models
The notion of computability is stable (i.e. independent of the choice of an indexing) over infinite-dimensional vector spaces provided they have a finite “tensorial dimension...
Pablo Arrighi, Gilles Dowek
ICAC
2007
IEEE
14 years 2 months ago
Approximation Modeling for the Online Performance Management of Distributed Computing Systems
—A promising method of automating management tasks in computing systems is to formulate them as control or optimization problems in terms of performance metrics. For an online op...
Dara Kusic, Nagarajan Kandasamy, Guofei Jiang
GECCO
2007
Springer
159views Optimization» more  GECCO 2007»
14 years 2 months ago
A systemic computation platform for the modelling and analysis of processes with natural characteristics
Computation in biology and in conventional computer architectures seem to share some features, yet many of their important characteristics are very different. To address this, [1]...
Erwan Le Martelot, Peter J. Bentley, R. Beau Lotto
BIRTHDAY
2005
Springer
14 years 1 months ago
Towards Comprehensive Computational Models for Plan-Based Control of Autonomous Robots
In this paper we present an overview of recent developments in the plan-based control of autonomous robots. We identify computational principles that enable autonomous robots to a...
Michael Beetz
AAAI
1990
13 years 9 months ago
Computing Stable Models by Using the ATMS
An algorithm is described which computes stable models of propositional logic programs with negation as failure using the Assumption Based Truth Maintenance mechanism. Since stabl...
Kave Eshghi