5100 search results - page 390 / 1020 » The Linear Complexity of a Graph |
186
click to vote
IWDC
2004
Springer
16 years 25 days 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...
199
Voted
IPPS
1997
IEEE
15 years 11 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 ...
222
click to vote
DBSEC
2009
15 years 8 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...
203
click to vote
IJWGS
2006
15 years 7 months ago
2006
: This paper presents a systematic study of some major problems involved in the transformation of business process modelling languages to executable business process representation...
209
click to vote
FSTTCS
2009
Springer
16 years 2 months ago
2009
Springer
Partial Cover problems are optimization versions of fundamental and well studied problems like Vertex Cover and Dominating Set. Here one is interested in covering (or dominating) ...