Sciweavers

5754 search results - page 674 / 1151
» Multi-class Model M
Sort
View
STTT
2010
97views more  STTT 2010»
15 years 5 months ago
Distributed dynamic partial order reduction
Abstract. Runtime (dynamic) model checking is a promising verification methodology for real-world threaded software because of its many features, the prominent ones being: (i) it ...
Yu Yang, Xiaofang Chen, Ganesh Gopalakrishnan, Rob...
TALG
2010
74views more  TALG 2010»
15 years 5 months ago
Comparison-based time-space lower bounds for selection
We establish the first nontrivial lower bounds on timespace tradeoffs for the selection problem. We prove that any comparison-based randomized algorithm for finding the median ...
Timothy M. Chan
EUROPAR
2010
Springer
15 years 5 months ago
Starsscheck: A Tool to Find Errors in Task-Based Parallel Programs
Star Superscalar is a task-based programming model. The programmer starts with an ordinary C program, and adds pragmas to mark functions as tasks, identifying their inputs and outp...
Paul M. Carpenter, Alex Ramírez, Eduard Ayg...
IMC
2010
ACM
15 years 5 months ago
Temporally oblivious anomaly detection on large networks using functional peers
Previous methods of network anomaly detection have focused on defining a temporal model of what is "normal," and flagging the "abnormal" activity that does not...
Kevin M. Carter, Richard Lippmann, Stephen W. Boye...
ISAAC
2010
Springer
253views Algorithms» more  ISAAC 2010»
15 years 5 months ago
Solving Two-Stage Stochastic Steiner Tree Problems by Two-Stage Branch-and-Cut
Abstract. We consider the Steiner tree problem under a 2-stage stochastic model with recourse and finitely many scenarios (SSTP). Thereby, edges are purchased in the first stage wh...
Immanuel M. Bomze, Markus Chimani, Michael Jü...