Sciweavers

1870 search results - page 126 / 374
» Abstract And-Parallel Machines
Sort
View
ASM
2000
ASM
15 years 3 months ago
An ASM Dynamic Semantics for Standard ML
Abstract. The Abstract State Machines (ASM) methodology is a methodology for formally specifying computing systems. We use the ASM methodology to give the dynamic semantics of the ...
Steven C. Cater, James K. Huggins
ICPP
1993
IEEE
15 years 3 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
ERSHOV
2006
Springer
15 years 2 months ago
An ASM Semantics of Token Flow in UML 2 Activity Diagrams
Abstract. The token flow semantics of UML 2 activity diagrams is formally defined using Abstract State Machines. Interruptible activity regions and multiplicity bounds for pins are...
Stefan Sarstedt, Walter Guttmann
85
Voted
ESA
2010
Springer
227views Algorithms» more  ESA 2010»
15 years 4 days ago
Approximating Parameterized Convex Optimization Problems
We consider parameterized convex optimization problems over the unit simplex, that depend on one parameter. We provide a simple and efficient scheme for maintaining an -approximat...
Joachim Giesen, Martin Jaggi, Sören Laue
ECEASST
2008
87views more  ECEASST 2008»
14 years 11 months ago
The GP Programming System
Abstract: We describe the programming system for the graph-transformation lan, focusing on the implementation of its compiler and abstract machine. We also compare the system'...
Greg Manning, Detlef Plump