Results 1  10
of
124
Collection Tree Protocol
"... This paper presents and evaluates two principles for designing robust, reliable, and efficient collection protocols. These principles allow a protocol to benefit from accurate and agile link estimators by handling the dynamism such estimators introduce to routing tables. The first is datapath valida ..."
Abstract
 Add to MetaCart
latency. We study these mechanisms in an implementation called Collection Tree Protocol (CTP) and evaluate their contributions to its performance. We evaluate CTP on 12 different testbeds ranging in size from 20–310 nodes and comprising 7 hardware platforms, on 6 different link layers, and on interference
Computing an Optimal Orientation of a Balanced Decomposition Tree for Linear Arrangement Problems
, 2001
"... Divideandconquer approximation algorithms for vertex ordering problems partition the vertex set of graphs, compute recursively an ordering of each part, and "glue" the orderings of the parts together. The computed ordering is specified by a decomposition tree that describes the recursive ..."
Abstract

Cited by 21 (0 self)
 Add to MetaCart
that agrees with the computed decomposition tree is within the range specified by the approximation factor. We address the question of whether an optimal ordering can be e#ciently computed among the exponentially many orderings induced by a binary decomposition tree. We present a polynomial time algorithm
Computing the Stretch Factor of Paths, Trees, and Cycles in Weighted Fixed Orientation Metrics
 CCCG
, 2008
"... Let G be a graph embedded in the L1plane. The stretch factor of G is the maximum over all pairs of distinct vertices p and q of G of the ratio L G 1 (p, q)/L1(p, q), where L G 1 (p, q) is the L1distance in G between p and q. We show how to compute the stretch factor of an nvertex path in O(n log ..."
Abstract
 Add to MetaCart
Let G be a graph embedded in the L1plane. The stretch factor of G is the maximum over all pairs of distinct vertices p and q of G of the ratio L G 1 (p, q)/L1(p, q), where L G 1 (p, q) is the L1distance in G between p and q. We show how to compute the stretch factor of an nvertex path in O(n log
TROY: A Tree Oriented Approach to Logic Synthesis and Technology Mapping
, 1996
"... The problem of provable optimal synthesis of boolean functions for a given technology is still unsolved. In this paper we present a new approach to the synthesis of combinational circuits and the mapping of standard cells with arbitrary number of inputs. Our method is based on the provable optimal s ..."
Abstract
 Add to MetaCart
by algebraic factorization ([1]) or transformation ([5]) and implement it for a given technol...
Approximation Algorithms for Orienteering and DiscountedReward TSP
, 2003
"... In this paper, we give the first constantfactor approximation algorithm for the rooted Orienteering problem, as well as a new problem that we call the DiscountedReward TSP, motivated by robot navigation. In both problems, we are given a graph with lengths on edges and prizes (rewards) on nodes, ..."
Abstract

Cited by 84 (1 self)
 Add to MetaCart
In this paper, we give the first constantfactor approximation algorithm for the rooted Orienteering problem, as well as a new problem that we call the DiscountedReward TSP, motivated by robot navigation. In both problems, we are given a graph with lengths on edges and prizes (rewards) on nodes
ON THE SPANNING TREES OF THE HYPERCUBE AND OTHER PRODUCTS OF GRAPHS
"... Abstract. We give two combinatorial proofs of an elegant product formula for the number of spanning trees of the ndimensional hypercube. The first proof is based on the assertion that if one chooses a uniformly random rooted spanning tree of the hypercube and orient each edge from parent to child, ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Abstract. We give two combinatorial proofs of an elegant product formula for the number of spanning trees of the ndimensional hypercube. The first proof is based on the assertion that if one chooses a uniformly random rooted spanning tree of the hypercube and orient each edge from parent to child
CAB: Fast update of OBB trees for collision detection between articulated bodies
 Journal of Graphics Tools
, 2004
"... We present a new, fast approach for updating oriented bounding box hierarchies for articulated humanoid models, using a bottom up approach. The algorithm approximates existing techniques by assuming a major body axis. Existence of a major axis allows merging of bounding boxes in a hierarchy approxim ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
approximately but with sufficient accuracy. For scenarios with close proximity a speedup by a factor 2 on average is achieved compared to existing techniques. 1
1A WEIGHTEDTREE SIMILARITY ALGORITHM FOR MULTIAGENT SYSTEMS IN EBUSINESS ENVIRONMENTS*
"... A tree similarity algorithm for matchmaking of agents in eBusiness environments is presented. Product/service descriptions of seller and buyer agents are represented as nodelabelled, arclabelled, arcweighted trees. A similarity algorithm for such trees is developed as the basis for semantic mat ..."
Abstract
 Add to MetaCart
matchmaking in a virtual marketplace. The trees are exchanged using an XML serialization in ObjectOriented RuleML. Correspondingly, we use the declarative language Relfun to implement the similarity algorithm as a parameterised, recursive functional program. Three main recursive functions perform a
1WEIGHTED PARTONOMYTAXONOMY TREES WITH LOCAL SIMILARITY MEASURES FOR SEMANTIC BUYERSELLER MATCHMAKING
"... A semantically enhanced weighted tree similarity algorithm for buyerseller matchmaking is presented. First, our earlier global, structural similarity measure over (product) partonomy trees is enriched by taxonomic semantics: Inner nodes can be labeled by classes whose partial subsumption order is ..."
Abstract
 Add to MetaCart
intermediate similarity values. Key Words/Phrases global similarity measure, local similarity measure, arclabeled and arcweighted trees, taxonomic class similarity, taxonomy tree, Weighted ObjectOriented RuleML, adjustment function, arithmetic mean 1.
BoundedAngle Spanning Tree: Modeling Networks with Angular Constraints
, 2014
"... We introduce a new structure for a set of points in the plane and an angle α, which is similar in flavor to a boundeddegree MST. We name this structure αMST. Let P be a set of points in the plane and let 0 < α ≤ 2pi be an angle. An αST of P is a spanning tree of the complete Euclidean graph in ..."
Abstract
 Add to MetaCart
We introduce a new structure for a set of points in the plane and an angle α, which is similar in flavor to a boundeddegree MST. We name this structure αMST. Let P be a set of points in the plane and let 0 < α ≤ 2pi be an angle. An αST of P is a spanning tree of the complete Euclidean graph
Results 1  10
of
124