3192 search results - page 405 / 639 » The minimum latency problem |
133
click to vote
IJRR
2007
15 years 4 months ago
2007
Efficient algorithms for collision-free energy sub-optimal path planning for formations of spacecraft flying in deep space are presented. The idea is to introduce a set of way-poi...
132
Voted
COMGEO
2004
ACM
15 years 3 months ago
2004
ACM
We show it is possible to tile three-dimensional space using only tetrahedra with acute dihedral angles. We present several constructions to achieve this, including one in which a...
156
click to vote
STOC
2010
ACM
15 years 9 months ago
2010
ACM
The Steiner tree problem is one of the most fundamental ÆÈ-hard problems: given a weighted undirected graph and a subset of terminal nodes, find a minimum weight tree spanning ...
159
click to vote
NIPS
2007
15 years 5 months ago
2007
We present a novel message passing algorithm for approximating the MAP problem in graphical models. The algorithm is similar in structure to max-product but unlike max-product it ...
146
click to vote
ICIP
2005
IEEE
16 years 5 months ago
2005
IEEE
Wireless mesh systems offer several advantages for emerging high-bandwidth networks because of their cooperative routing capabilities. In this study, we consider the potential ben...