71 search results - page 5 / 15 » Partial Order Reduction for Probabilistic Branching Time |
FSTTCS
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. We identify a network of sequential processes that communicate by synchronizing frequently on common actions. More precisely, we demand that there is a bound k such that ...
ECCV
2002
Springer
15 years 11 months ago
2002
Springer
Over the last decade, a number of methods for geometric matching based on a branch-and-bound approach have been proposed. Such algorithms work by recursively subdividing transforma...
AAAI
2006
14 years 11 months ago
2006
We examine a setting in which a buyer wishes to purchase probabilistic information from some agent. The seller must invest effort in order to gain access to the information, and m...
122
Voted
ATVA
2006
Springer
15 years 1 months ago
2006
Springer
Whereas partial order methods have proved their efficiency for the analysis of discrete-event systems, their application to timed systems remains a challenging research topic. Here...
COMPSEC
2010
14 years 9 months ago
2010
Model checking security protocols is based on an intruder model that represents the eavesdropping or interception of the exchanged messages, while at the same time performs attack...