Sciweavers

1204 search results - page 152 / 241
» Parallel concurrent ML
Sort
View
112
Voted
PLDI
1990
ACM
15 years 7 months ago
Task Granularity Analysis in Logic Programs
While logic programming languages offer a great deal of scope for parallelism, there is usually some overhead associated with the execution of goals in parallel because of the wor...
Saumya K. Debray, Nai-Wei Lin, Manuel V. Hermenegi...
117
Voted
CW
2004
IEEE
15 years 7 months ago
Analytically-Defined Collaborative Shape Modeling in VRML
In this paper we introduce a function-defined extension of Virtual Reality Modeling Language where analytical formulas are used for defining geometry and appearance of 3D shapes. ...
Qi Liu, Alexei Sourin
165
Voted
COORDINATION
2006
Springer
15 years 7 months ago
Formalising Business Process Execution with Bigraphs and Reactive XML
Bigraphical Reactive Systems have been proposed as a meta model for global ubiquitous computing generalising process calculi for mobility such as the pi-calculus and the Mobile Amb...
Thomas T. Hildebrandt, Henning Niss, Martin Olsen
141
Voted
FPL
2006
Springer
208views Hardware» more  FPL 2006»
15 years 7 months ago
Implementation in Fpgas of Jacobi Method to Solve the Eigenvalue and Eigenvector Problem
This work shows a modular architecture based on FPGA's to solve the eigenvalue problem according to the Jacobi method. This method is able to solve the eigenvalues and eigenv...
Ignacio Bravo, Pedro Jiménez, Manuel Mazo, ...
136
Voted
CONCUR
2000
Springer
15 years 7 months ago
Model Checking with Finite Complete Prefixes Is PSPACE-Complete
Unfoldings are a technique for verification of concurrent and distributed systems introduced by McMillan. The method constructs a finite complete prefix, which can be seen as a sym...
Keijo Heljanko