140 search results - page 27 / 28 » Verifying timing properties of concurrent algorithms |
SIGMOD
2010
ACM
13 years 10 months ago
2010
ACM
Maximal clique enumeration (MCE) is a fundamental problem in graph theory and has important applications in many areas such as social network analysis and bioinformatics. The prob...
APLAS
2007
ACM
13 years 9 months ago
2007
ACM
Abstract. Given the combinatorial nature of cellular signalling pathways, where biological agents can bind and modify each other in a large number of ways, concurrent or agent-base...
INFOCOM
2006
IEEE
13 years 11 months ago
2006
IEEE
—Many applications require fast data transfer over high speed and long distance networks. However, standard TCP fails to fully utilize the network capacity due to the limitation ...
CAV
2007
Springer
13 years 12 months ago
2007
Springer
Abstract. Regular model checking is a form of symbolic model checking technique for systems whose states can be represented as finite words over a finite alphabet, where regular ...
AAAI
1997
13 years 7 months ago
1997
Many stochastic planning problems can be represented using Markov Decision Processes (MDPs). A difficulty with using these MDP representations is that the common algorithms for so...