Sciweavers

2432 search results - page 38 / 487
» Using simple abstraction to reinvent computing for paralleli...
Sort
View
CONCUR
2006
Springer
15 years 1 months ago
A Livelock Freedom Analysis for Infinite State Asynchronous Reactive Systems
We describe an incomplete but sound and efficient livelock freedom test for infinite state asynchronous reactive systems. The method s a system into a set of simple control flow cy...
Stefan Leue, Alin Stefanescu, Wei Wei
POPL
2009
ACM
15 years 4 months ago
Low-pain, high-gain multicore programming in Haskell: coordinating irregular symbolic computations on multicore architectures
With the emergence of commodity multicore architectures, exploiting tightly-coupled parallelism has become increasingly important. Functional programming languages, such as Haskel...
Abdallah Al Zain, Kevin Hammond, Jost Berthold, Ph...
ENTCS
1998
101views more  ENTCS 1998»
14 years 9 months ago
A Fully Abstract Metric-Space Denotational Semantics for Reactive Probabilistic Processes
Abstract Metric-Space Denotational Semantics for Reactive Probabilistic Processes M.Z. Kwiatkowska and G.J. Norman School of Computer Science, University of Birmingham, Edgbaston, ...
Marta Z. Kwiatkowska, Gethin Norman
EDUTAINMENT
2006
Springer
15 years 1 months ago
Computer Supported Remote Learning and Gaming Using Tele-Face Mouse System
Abstract. This paper presents a new computer supported remote learning and gaming method using Tele-Face Mouse system. The Tele-Face Mouse system is being developed as a teleconfer...
Sang Chul Ahn, Jin Hak Kim, Hyoung-Gon Kim
ICPP
1993
IEEE
15 years 1 months ago
Data-Parallel R-Tree Algorithms
Abstract Data-parallel algorithms for R-trees, a common spatial data structure are presented, in the domain of planar line segment data e.g., Bureau of the Census TIGER Line les....
Erik G. Hoel, Hanan Samet