Sciweavers

42 search results - page 8 / 9
» Formalizing Design Spaces: Implicit Invocation Mechanisms
Sort
View
ICDE
2011
IEEE
238views Database» more  ICDE 2011»
12 years 9 months ago
Join queries on uncertain data: Semantics and efficient processing
— Uncertain data is quite common nowadays in a variety of modern database applications. At the same time, the join operation is one of the most important but expensive operations...
Tingjian Ge
IJCAI
1989
13 years 7 months ago
Reasoning about Kinematic Topology
t ion which is much more abstract than a place vocabulary, the kinematic topology. Kinematic topology does not define qualitative inference rules, but provides a characterization o...
Boi Faltings, Emmanuel Baechler, J. Primus
SIMPRA
2008
131views more  SIMPRA 2008»
13 years 5 months ago
Distributed simulation of DEVS and Cell-DEVS models in CD++ using Web-Services
: DEVS is a Modeling and Simulation formalism that has been widely used to study the dynamics of discrete event systems. Cell-DEVS is a DEVS-based formalism that defines spatial mo...
Gabriel A. Wainer, Rami Madhoun, Khaldoon Al-Zoubi
TSE
1998
114views more  TSE 1998»
13 years 5 months ago
KLAIM: A Kernel Language for Agents Interaction and Mobility
—We investigate the issue of designing a kernel programming language for mobile computing and describe KLAIM, a language that supports a programming paradigm where processes, lik...
Rocco De Nicola, Gian Luigi Ferrari, Rosario Pugli...
CADE
2007
Springer
14 years 6 months ago
Solving Quantified Verification Conditions Using Satisfiability Modulo Theories
Abstract. First order logic provides a convenient formalism for describing a wide variety of verification conditions. Two main approaches to checking such conditions are pure first...
Yeting Ge, Clark Barrett, Cesare Tinelli