1617 search results - page 181 / 324 » Parallel Cost Analysis of Distributed Systems |
140
click to vote
ENTCS
2008
15 years 3 months ago
2008
The verification of quantitative aspects like performance and dependability by means of model checking has become an important and vivid area of research over the past decade. An ...
139
click to vote
HIPC
2005
Springer
15 years 8 months ago
2005
Springer
Graph theoretic problems are representative of fundamental computations in traditional and emerging scientific disciplines like scientific computing, computational biology and b...
135
click to vote
PODC
2006
ACM
15 years 9 months ago
2006
ACM
Coloring the nodes of a graph with a small number of colors is one of the most fundamental problems in theoretical computer science. In this paper, we study graph coloring in a di...
120
click to vote
APN
2003
Springer
15 years 8 months ago
2003
Springer
Model checking by exhaustive state space enumeration is one of the most developed analysis methods for distributed event systems. Its main problem—the size of the state spaces—...
111
click to vote
PODC
2009
ACM
16 years 3 months ago
2009
ACM
d Abstract] Prosenjit Bose School of Computer Science Carleton University Ottawa, Canada jit@scs.carleton.ca Paz Carmi Dept. of Computer Science Ben-Gurion Univ. of the Negev Beer-...