Sciweavers

34974 search results - page 231 / 6995
» The particle computer system
Sort
View
STACS
2010
Springer
16 years 2 months ago
Computing Least Fixed Points of Probabilistic Systems of Polynomials
We study systems of equations of the form X1 = f1(X1, . . . , Xn), . . . , Xn = fn(X1, . . . , Xn) where each fi is a poly
Javier Esparza, Andreas Gaiser, Stefan Kiefer
VL
2000
IEEE
136views Visual Languages» more  VL 2000»
15 years 11 months ago
A Data-Flow Visual Approach to Symbolic Computing: Implementing a Production-Rule-Based Programming System through a General-Pur
The main aim of this paper is to investigate how the production-rule-based computational paradigm can be implemented through visual data-flow techniques. We propose a simple yet e...
Mauro Mosconi, Marco Porta
CLUSTER
2004
IEEE
15 years 11 months ago
Cluster computing environment supporting single system image
Single system image(SSI) systems have been the mainstay of high-performance computing for many years. SSI requires the integration and aggregation of all types of resources in a c...
Min Choi, DaeWoo Lee, Seung Ryoul Maeng
CADE
2008
Springer
15 years 9 months ago
Automated Implicit Computational Complexity Analysis (System Description)
Recent studies have provided many characterisations of the class of polynomial time computable functions through term rewriting techniques. In this paper we describe a (fully autom...
Martin Avanzini, Georg Moser, Andreas Schnabl
AAAI
2006
15 years 8 months ago
Laughing with HAHAcronym, a Computational Humor System
Computational humor is a challenge with implications for many classical fields in AI such as, for example, natural language processing, intelligent human-computer interaction, rea...
Oliviero Stock, Carlo Strapparava