Sciweavers

947 search results - page 160 / 190
» Discrete Geometry
Sort
View
ICML
2007
IEEE
15 years 10 months ago
Constructing basis functions from directed graphs for value function approximation
Basis functions derived from an undirected graph connecting nearby samples from a Markov decision process (MDP) have proven useful for approximating value functions. The success o...
Jeffrey Johns, Sridhar Mahadevan
88
Voted
FUZZIEEE
2007
IEEE
15 years 4 months ago
On the Accuracy of Type-2 Fuzzy Sets
— Geometric Type-2 Fuzzy sets allow us to model type-2 fuzzy sets using geometry providing significant improvement in speed of computation. This paper explores in detail how wel...
Simon Coupland, Robert John
WEA
2007
Springer
107views Algorithms» more  WEA 2007»
15 years 3 months ago
Trunk Packing Revisited
For trunk packing problems only few approximation schemes are known, mostly designed for the European standard DIN 70020 [6] with equally sized boxes [8, 9, 11, 12]. In this paper ...
Ernst Althaus, Tobias Baumann, Elmar Schömer,...
IROS
2006
IEEE
113views Robotics» more  IROS 2006»
15 years 3 months ago
A Framework for Automatic Deployment of Robots in 2D and 3D Environments
Abstract— We present a computational framework for automatic deployment of robots in 2D and 3D rectangular environments with polytopal obstacles. The results are derived for poly...
Marius Kloetzer, Calin Belta
ICA
2004
Springer
15 years 3 months ago
Some Gradient Based Joint Diagonalization Methods for ICA
Abstract. We present a set of gradient based orthogonal and nonorthogonal matrix joint diagonalization algorithms. Our approach is to use the geometry of matrix Lie groups to devel...
Bijan Afsari, Perinkulam S. Krishnaprasad