122 search results - page 24 / 25 » Using Disjoint Reachability for Parallelization |
105
Voted
MPC
2010
Springer
14 years 11 months ago
2010
Springer
ion of Object Graphs in Program Verification Yifeng Chen1 and J.W. Sanders2 1 HCST Key Lab at School of EECS, Peking University, China. 2 UNU-IIST, Macao. A set-theoretic formalism...
ICPPW
2002
IEEE
15 years 2 months ago
2002
IEEE
Abstract— In order to provide reliable connections across metropolitan and wide-area optical networks, the network operator must provide some degree of redundancy so that traffic...
JC
2007
14 years 9 months ago
2007
A discontinuous Galerkin (DG) discretization of Dirichlet problem for second-order elliptic equations with discontinuous coefficients in 2-D is considered. For this discretization...
ASMTA
2008
Springer
14 years 11 months ago
2008
Springer
The solution of continuous and discrete-time Markovian models is still challenging mainly when we model large complex systems, for example, to obtain performance indexes of paralle...
SIGCOMM
2010
ACM
14 years 9 months ago
2010
ACM
The Internet is organized as a collection of administrative domains, known as Autonomous Systems (ASes). These ASes interact through the Border Gateway Protocol (BGP) that allows ...