Sciweavers

1802 search results - page 106 / 361
» Complexity Theory for Operators in Analysis
Sort
View
CSL
2010
Springer
15 years 7 months ago
On the Computability of Region-Based Euclidean Logics
By a Euclidean logic, we understand a formal language whose variables range over subsets of Euclidean space, of some fixed dimension, and whose non-logical primitives have fixed me...
Yavor Nenov, Ian Pratt-Hartmann
PEWASUN
2004
ACM
15 years 11 months ago
An M/MMGI/1/K queuing model for IEEE 802.11 ad hoc networks
An M/MMGI/1/K queuing model is developed for the analysis of IEEE 802.11 DCF using RTS/CTS. Results are based on arbitrary contention conditions, namely, collision probabilities, ...
Mustafa Özdemir, A. Bruce McDonald
ICNS
2007
IEEE
16 years 18 days ago
Data fusion algorithms for network anomaly detection: classification and evaluation
In this paper, the problem of discovering anomalies in a large-scale network based on the data fusion of heterogeneous monitors is considered. We present a classification of anoma...
Vasilis Chatzigiannakis, Georgios Androulidakis, K...
CODES
2006
IEEE
16 years 10 days ago
Battery discharge aware energy feasibility analysis
It is observed that pulsed discharge currents allow to drain the battery with a higher specific power. Thus they improve the batteries durability and discharge performance. The q...
Henrik Lipskoch, Karsten Albers, Frank Slomka
CORR
2008
Springer
110views Education» more  CORR 2008»
15 years 5 months ago
The Tractability of Model-Checking for LTL: The Good, the Bad, and the Ugly Fragments
In a seminal paper from 1985, Sistla and Clarke showed that the model-checking problem for Linear Temporal Logic (LTL) is either NP-complete or PSPACE-complete, depending on the se...
Michael Bauland, Martin Mundhenk, Thomas Schneider...