Sciweavers

144 search results - page 22 / 29
» How Expressions Can Code for Automata
Sort
View
ESWS
2009
Springer
14 years 10 months ago
Applied Temporal RDF: Efficient Temporal Querying of RDF Data with SPARQL
Many applications operate on time-sensitive data. Some of these data are only valid for certain intervals (e.g., job-assignments, versions of software code), others describe tempor...
Jonas Tappolet, Abraham Bernstein
SPAA
1997
ACM
15 years 4 months ago
Pipelining with Futures
Pipelining has been used in the design of many PRAM algorithms to reduce their asymptotic running time. Paul, Vishkin, and Wagener (PVW) used the approach in a parallel implementat...
Guy E. Blelloch, Margaret Reid-Miller
FCCM
2006
IEEE
101views VLSI» more  FCCM 2006»
15 years 6 months ago
A Type Architecture for Hybrid Micro-Parallel Computers
Recently, platform FPGAs that integrate sequential processors with a spatial fabric have become prevalent. While these hybrid architectures ease the burden of integrating sequenti...
Benjamin Ylvisaker, Brian Van Essen, Carl Ebeling
97
Voted
WSC
2004
15 years 1 months ago
Modeling Real-World Control Systems: Beyond Hybrid Systems
Hybrid system modeling refers to the construction of system models combining both continuous and discrete dynamics. These models can greatly reduce the complexity of a phystem mod...
Stephen Neuendorffer
JFP
2008
72views more  JFP 2008»
15 years 12 days ago
Dynamic rebinding for marshalling and update, via redex-time and destruct-time reduction
Most programming languages adopt static binding, but for distributed programming an exclusive reliance on static binding is too restrictive: dynamic binding is required in various...
Peter Sewell, Gareth Stoyle, Michael Hicks, Gavin ...