2612 search results - page 205 / 523 » Switching Graphs and Their Complexity |
105
click to vote
ECAL
2003
Springer
15 years 9 months ago
2003
Springer
Building large complex minds is difficult because we do not understand what the necessary components are or how they should interact. Even if the components were known it is diffic...
140
click to vote
IWDC
2004
Springer
15 years 10 months ago
2004
Springer
Abstract. Despite their crucial impact on the performances of p2p systems, very few is known on peers behaviors in such networks. We propose here a study of these behaviors in a ru...
140
click to vote
IPPS
1997
IEEE
15 years 8 months ago
1997
IEEE
The n-dimensional grid is one of the most representative patterns of data flow in parallel computation. The most frequently used scheduling models for grids is the unit execution ...
154
click to vote
DBSEC
2009
15 years 5 months ago
2009
Abstract. Identifying and protecting the trusted computing base (TCB) of a system is an important task, which is typically performed by designing and enforcing a system security po...
124
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
Abstract-- This paper addresses the issue of design of lowrate sparse-graph codes with linear minimum distance in the blocklength. First, we define a necessary condition which need...