1382 search results - page 113 / 277 » Formal Analysis of Online Algorithms |
164
Voted
SPAA
2004
ACM
15 years 11 months ago
2004
ACM
This paper considers the problem of packet-mode scheduling of input queuedswitches. Packets have variable lengths, and are divided into cells of unit length. Each packet arrives t...
158
click to vote
CAV
2007
Springer
16 years 10 days ago
2007
Springer
Bounded context switch reachability analysis is a useful and efficient approach for detecting bugs in multithreaded programs. In this paper, we address the application of this app...
140
click to vote
ICASSP
2008
IEEE
16 years 18 days ago
2008
IEEE
Component forensics is an emerging methodology for forensic analysis that aims at estimating the algorithms and parameters in each component of a digital device. This paper propos...
168
click to vote
CAV
2000
Springer
15 years 9 months ago
2000
Springer
Hierarchical state machines is a popular visual formalism for software specifications. To apply automated analysis to such specifications, the traditional approach is to compile th...
164
click to vote
FUIN
2007
15 years 6 months ago
2007
Abstract. Approximate Petri nets (AP-nets) can be used for the knowledge representation and approximate reasoning. The AP-net model is defined on the basis of the rough set approa...