Sciweavers

16430 search results - page 108 / 3286
» On Computable Tree Functions
Sort
View
116
Voted
ICRA
2007
IEEE
134views Robotics» more  ICRA 2007»
15 years 9 months ago
Locally Computable Navigation Functions for Sphere Worlds
Abstract— In this paper we present a new Navigation Function for a sphere world that can be computed locally with limited knowledge of the environment. By requiring smooth and no...
Grigoris Lionis, Xanthi Papageorgiou, Kostas J. Ky...
135
Voted
LCN
1999
IEEE
15 years 7 months ago
The New Shortest Best Path Tree (SBPT) Algorithm for Dynamic Multicast Trees
This paper presents the new Shortest Best Path Tree (SBPT) algorithm for multicast trees. The SBPT algorithm establishes and maintains dynamic multicast trees which maximize the b...
Hiroshi Fujinoki, Kenneth J. Christensen
131
Voted
CGI
2004
IEEE
15 years 7 months ago
BlobTree Trees
In recent years several methods for modeling botanical trees have been proposed. The geometry and topology of tree skeletons can be well described by L-systems; however, there are...
Callum Galbraith, Peter MacMurchy, Brian Wyvill
ANTS
2000
Springer
92views Algorithms» more  ANTS 2000»
15 years 7 months ago
Computing Special Values of Partial Zeta Functions
We discuss computation of the special values of partial zeta functions associated to totally real number fields. The main tool is the Eisenstein cocycle Ψ, a group cocycle for GL...
Gautam Chinta, Paul E. Gunnells, Robert Sczech
PODC
1997
ACM
15 years 7 months ago
Computing Vector Functions on Anonymous Networks
In an anonymous network processors have no distinct identifiers. For any class of anonymous networks, we characterize effectively the vector functions f : n → n which are compu...
Paolo Boldi, Sebastiano Vigna