Sciweavers

1254 search results - page 245 / 251
» Making Hard Problems Harder
Sort
View
CCS
2008
ACM
13 years 9 months ago
A general model of probabilistic packet marking for IP traceback
In this paper, we model Probabilistic Packet Marking (PPM) schemes for IP traceback as an identification problem of a large number of markers. Each potential marker is associated ...
Liming Lu, Mun Choon Chan, Ee-Chien Chang
CASES
2005
ACM
13 years 9 months ago
Architectural support for real-time task scheduling in SMT processors
In Simultaneous Multithreaded (SMT) architectures most hardware resources are shared between threads. This provides a good cost/performance trade-off which renders these architec...
Francisco J. Cazorla, Peter M. W. Knijnenburg, Riz...
ICSE
2010
IEEE-ACM
13 years 9 months ago
Efficient hybrid typestate analysis by determining continuation-equivalent states
Typestate analysis determines whether a program violates a set of finite-state properties. Because the typestate-analysis problem is statically undecidable, researchers have propo...
Eric Bodden
EMSOFT
2008
Springer
13 years 9 months ago
Quantitative testing
We investigate the problem of specification based testing with dense sets of inputs and outputs, in particular with imprecision as they might occur due to errors in measurements, ...
Henrik C. Bohnenkamp, Mariëlle Stoelinga
CONEXT
2009
ACM
13 years 8 months ago
Traffic management and resource allocation in small wired/wireless networks
We consider the problem of traffic management in small networks with both wireless and wired devices, connected to the Internet through a single gateway. Examples of such networks...
Christos Gkantsidis, Thomas Karagiannis, Peter B. ...