Sciweavers

1012 search results - page 96 / 203
» Process Algebra with Backtracking
Sort
View
199
Voted
ICDE
1999
IEEE
106views Database» more  ICDE 1999»
16 years 3 months ago
Processing Operations with Restrictions in RDBMS without External Sorting: The Tetris Algorithm
Most operations of the relational algebra or SQL require a sorted stream of tuples for efficient processing. Therefore, processing complex relational queries relies on efficient a...
Volker Markl, Martin Zirkel, Rudolf Bayer
104
Voted
LICS
2002
IEEE
15 years 7 months ago
The Metric Analogue of Weak Bisimulation for Probabilistic Processes
We observe that equivalence is not a robust concept in the presence of numerical information - such as probabilities - in the model. We develop a metric analogue of weak bisimulat...
Josee Desharnais, Radha Jagadeesan, Vineet Gupta, ...
CIDR
2009
98views Algorithms» more  CIDR 2009»
15 years 3 months ago
From Declarative Languages to Declarative Processing in Computer Games
Recent work has shown that we can dramatically improve the performance of computer games and simulations through declarative processing: Character AI can be written in an imperati...
Ben Sowell, Alan J. Demers, Johannes Gehrke, Nitin...
FAC
2008
114views more  FAC 2008»
15 years 2 months ago
Specification of communicating processes: temporal logic versus refusals-based refinement
Abstract. In this paper we consider the relationship between refinement-oriented specification and specifications using a temporal logic. We investigate the extent to which one can...
Gavin Lowe
CONCURRENCY
2006
148views more  CONCURRENCY 2006»
15 years 2 months ago
An adaptive parallel query processing middleware for the Grid
vices provide an important abstract layer on top of heterogeneous components (hardware and software) that take part into a grid environment. In this scenario, applications, like sc...
Vinícius F. V. da Silva, Márcio L. D...