3396 search results - page 319 / 680 » Tree representations of graphs |
154
click to vote
SEMWEB
2009
Springer
16 years 1 months ago
2009
Springer
Linked open data offers a set of design patterns and conventions for sharing data across the semantic web. In this position paper we enumerate some key uncertainty representation i...
159
click to vote
AIPS
2008
15 years 9 months ago
2008
The current evaluation functions for heuristic planning are expensive to compute. In numerous domains these functions give good guidance on the solution, so it worths the computat...
172
click to vote
INFOCOM
2002
IEEE
15 years 11 months ago
2002
IEEE
— Most of the currently deployed multicast protocols (e.g. DVMRP, PIM, MOSPF) build one shortest path multicast tree per sender, the tree being rooted at the sender’s subnetwor...
187
click to vote
CIAC
2000
Springer
15 years 11 months ago
2000
Springer
A minimum spanning tree (MST) with a small diameter is required in numerous practical situations. It is needed, for example, in distributed mutual exclusion algorithms in order to ...
193
click to vote
CORR
2011
Springer
15 years 1 months ago
2011
Springer
Abstract. In this paper, we propose a new construction of constantdegree expanders motivated by their application in P2P overlay networks and in particular in the design of robust ...