331 search results - page 43 / 67 » Fragments of order |
DSOM
1999
Springer
14 years 1 months ago
1999
Springer
: Solutions in the network and service management layers of telecommunications management architectures are currently fragmented both in terms of standards and products. It is ofte...
ICALP
1990
Springer
14 years 23 days ago
1990
Springer
A system of hierarchical, fully recursive types in a truly imperative language allows program fragments written for small types to be reused for all larger types. To exploit this ...
ENTCS
2007
13 years 8 months ago
2007
In the theory of graph rewriting, the use of coalescing rules, i.e., of rules which besides deleting and generating graph items, can coalesce some parts of the graph, turns out to...
JCM
2010
13 years 7 months ago
2010
— This paper presents a resource-efficient protocol for opportunistic routing in delay-tolerant networks (DTN). First, our approach exploits the context of mobile nodes (speed, ...
TVCG
2011
13 years 3 months ago
2011
We present two novel algorithms for constructing spatial hierarchies on GPUs. The first is for kd-trees that automatically balances between the level of parallelism and total mem...