Sciweavers

846 search results - page 122 / 170
» On the Computational Complexity of Spatio-Temporal Logics
Sort
View
CASC
2006
Springer
128views Mathematics» more  CASC 2006»
15 years 2 months ago
New Domains for Applied Quantifier Elimination
We address various aspects of our computer algebra-based computer logic system redlog. There are numerous examples in the literature for successful applications of redlog to practi...
Thomas Sturm
DLOG
2004
15 years 16 days ago
A Uniform Tableaux-Based Approach to Concept Abduction and Contraction in ALN
We present algorithms based on truth-prefixed tableaux to solve both Concept Abduction and Contraction in ALN DL. We also analyze the computational complexity of the problems, sho...
Simona Colucci, Tommaso Di Noia, Eugenio Di Sciasc...
DEBS
2008
ACM
15 years 7 days ago
Availability models for underlay aware overlay networks
Availability of an overlay network is a necessary condition for event delivery in event based systems. The availability of the overlay links depends on the underlying physical net...
Madhu Kumar SD, Umesh Bellur
ICDE
2009
IEEE
121views Database» more  ICDE 2009»
15 years 6 months ago
Scalability for Virtual Worlds
— Networked virtual environments (net-VEs) are the next wave of digital entertainment, with Massively Multiplayer Online Games (MMOs) a very popular instance. Current MMO archite...
Nitin Gupta 0003, Alan J. Demers, Johannes Gehrke,...
VLSID
2006
IEEE
129views VLSI» more  VLSID 2006»
15 years 11 months ago
A Stimulus-Free Probabilistic Model for Single-Event-Upset Sensitivity
With device size shrinking and fast rising frequency ranges, effect of cosmic radiations and alpha particles known as Single-Event-Upset (SEU), Single-Eventtransients (SET), is a ...
Mohammad Gh. Mohammad, Laila Terkawi, Muna Albasma...