Sciweavers

5015 search results - page 917 / 1003
» Model Checking a Path
Sort
View
PVLDB
2010
152views more  PVLDB 2010»
13 years 7 months ago
k-Nearest Neighbors in Uncertain Graphs
Complex networks, such as biological, social, and communication networks, often entail uncertainty, and thus, can be modeled as probabilistic graphs. Similar to the problem of sim...
Michalis Potamias, Francesco Bonchi, Aristides Gio...
QUESTA
2010
107views more  QUESTA 2010»
13 years 7 months ago
On the inapproximability of M/G/K: why two moments of job size distribution are not enough
The M/G/K queueing system is one of the oldest model for multi-server systems, and has been the topic of performance papers for almost half a century. However, even now, only coar...
Varun Gupta, Mor Harchol-Balter, J. G. Dai, Bert Z...
SEKE
2010
Springer
13 years 7 months ago
A String Constraint Solver for Detecting Web Application Vulnerability
Given the bytecode of a software system, is it possible to automatically generate attack signatures that reveal its vulnerabilities? A natural solution would be symbolically execu...
Xiang Fu, Chung-Chih Li
FSTTCS
2010
Springer
13 years 7 months ago
Combinatorial Problems with Discounted Price Functions in Multi-agent Systems
ABSTRACT. Motivated by economic thought, a recent research agenda has suggested the algorithmic study of combinatorial optimization problems under functions which satisfy the prope...
Gagan Goel, Pushkar Tripathi, Lei Wang
ISOLA
2010
Springer
13 years 6 months ago
Context-Sensitivity in IPET for Measurement-Based Timing Analysis
Abstract. The Implicit Path Enumeration Technique (IPET) has become widely accepted as a powerful technique to compute upper bounds on the Worst-Case Execution Time (WCET) of time-...
Michael Zolda, Sven Bünte, Raimund Kirner