613 search results - page 15 / 123 » The Model-Summary Problem and a Solution for Trees |
ICRA
2009
IEEE
14 years 1 months ago
2009
IEEE
— This paper presents inverse position kinematics algorithms with real time capability for Justin, a robotic system with high redundancy and many degrees of freedom. The combinat...
MP
2006
13 years 6 months ago
2006
The vast size of real world stochastic programming instances requires sampling to make them practically solvable. In this paper we extend the understanding of how sampling affects ...
ICALP
2011
Springer
12 years 10 months ago
2011
Springer
We consider the following Tree-Constrained Bipartite Matching problem: Given two rooted trees T1 = (V1, E1), T2 = (V2, E2) and a weight function w : V1 × V2 → R+, find a maximu...
PODC
2011
ACM
12 years 9 months ago
2011
ACM
A maximal independent set on a graph is an inclusion-maximal set of mutually non-adjacent nodes. This basic symmetry breaking structure is vital for many distributed algorithms, w...
SODA
2003
ACM
13 years 8 months ago
2003
ACM
The natural relaxation for the Group Steiner Tree problem, as well as for its generalization, the Directed Steiner Tree problem, is a flow-based linear programming relaxation. We...