945 search results - page 53 / 189 » Graph Types |
118
click to vote
RTCSA
2007
IEEE
15 years 8 months ago
2007
IEEE
MB++ is a system that caters to the dynamic needs of applications in a distributed, pervasive computing environment that has a wide variety of devices that act as producers and co...
103
click to vote
WG
1995
Springer
15 years 5 months ago
1995
Springer
Abstract. In this paper, we investigate which processor networks allow klabel Interval Routing Schemes, under the assumption that costs of edges may vary. We show that for each xed...
114
click to vote
JUCS
2007
15 years 1 months ago
2007
: For modeling real-life situations where not only the intensity of the relation existing between elements but also its polarity is important, we have proposed (see [Marcus and Tat...
111
click to vote
SIGECOM
2004
ACM
15 years 7 months ago
2004
ACM
We provide efficient algorithms for finding approximate BayesNash equilibria (BNE) in graphical, specifically tree, games of incomplete information. In such games an agent’s p...
113
click to vote
DNA
2006
Springer
15 years 5 months ago
2006
Springer
We study the complexity of the Accretive Graph Assembly Problem (AGAP). An instance of AGAP consists of an edge-weighted graph G, a seed vertex in G, and a temperature . The goal i...