798 search results - page 101 / 160 » Proving More Properties with Bounded Model Checking |
PE
2010
Springer
13 years 2 months ago
2010
Springer
In today's Internet, a large part of the traffic is carried using the TCP transport protocol. Characterization of the variations of TCP traffic is thus a major challenge, bot...
CDC
2009
IEEE
13 years 8 months ago
2009
IEEE
In this paper, we study the reachability problem for the class of (strictly) monotone Petri nets that we define based on algebraic conditions. More specifically, given a (strictly)...
COMCOM
2004
13 years 7 months ago
2004
In the emerging high-speed packet-switched networks, fair packet scheduling algorithms in switches and routers will form an important component of the mechanisms that seek to sati...
WAOA
2004
Springer
14 years 1 months ago
2004
Springer
We consider a non-preemptive, stochastic parallel machine scheduling model with the goal to minimize the weighted completion times of jobs. In contrast to the classical stochastic ...
COCO
2009
Springer
14 years 2 months ago
2009
Springer
Locally testable codes (LTCs) are error-correcting codes for which membership, in the code, of a given word can be tested by examining it in very few locations. Most known constru...