1952 search results - page 272 / 391 » Complete partitions of graphs |
165
click to vote
SIROCCO
2004
15 years 7 months ago
2004
We study here the gossiping problem (all-to-all communication) in known radio networks, i.e., when all nodes are aware of the network topology. We start our presentation with a det...
186
click to vote
UAI
2000
15 years 7 months ago
2000
In this paper we present decomposable priors, a family of priors over structure and parameters of tree belief nets for which Bayesian learning with complete observations is tracta...
167
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
We present a detailed study about the role of the short-cuts of a network in promoting the emergence of cooperation in a population of agents playing the Prisoner's Dilemma Ga...
177
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
Motivated by applications in grid computing and projects management, we study multiprocessor scheduling in scenarios where there is uncertainty in the successful execution of jobs...
178
click to vote
JUCS
2006
15 years 6 months ago
2006
: Program slicing is a well known family of techniques used to identify code fragments which depend on or are depended upon specific program entities. They are particularly useful ...