Sciweavers

1534 search results - page 65 / 307
» Stochastic Bounds on Execution Times of Parallel Computation...
Sort
View
HPDC
1999
IEEE
14 years 2 days ago
Techniques for Automating Distributed Real-Time Applications Design
We present a performance-based methodology for designing a high-bandwidth radar application on commodity platforms. Unlike many real-time systems, our approach works for commodity...
Dong-In Kang, Richard Gerber, Leana Golubchik, Jef...
MEMOCODE
2003
IEEE
14 years 1 months ago
Exact Runtime Analysis Using Automata-Based Symbolic Simulation
In this paper, we present a technique for determining tight bounds on the execution time of assembler programs. Thus, our method is independent of the design flow, but takes into...
Tobias Schüle, Klaus Schneider
STACS
1999
Springer
14 years 1 days ago
A Complete and Tight Average-Case Analysis of Learning Monomials
Abstract. We advocate to analyze the average complexity of learning problems. An appropriate framework for this purpose is introduced. Based on it we consider the problem of learni...
Rüdiger Reischuk, Thomas Zeugmann
PADS
1999
ACM
14 years 3 days ago
Exploiting Temporal Uncertainty in Parallel and Distributed Simulations
Most work to date in parallel and distributed discrete event simulation is based on assigning precise time stamps to events, and time stamp order event processing. An alternative ...
Richard Fujimoto
ICDCS
2008
IEEE
14 years 2 months ago
Analysis of Maximum Executable Length for Detecting Text-Based Malware
The possibility of using purely text stream (keyboardenterable) as carrier of malware is under-researched and often underestimated. A text attack can happen at multiple levels, fr...
P. Kumar Manna, Sanjay Ranka, Shigang Chen