Sciweavers

40 search results - page 3 / 8
» Exact Algorithms for a Geometric Packing Problem (Extended A...
Sort
View
ICRA
2006
IEEE
217views Robotics» more  ICRA 2006»
14 years 2 months ago
Complete Coverage Control for Nonholonomic Mobile Robots in Dynamic Environments
— We study the problem of generating continuous steering control for robots to completely cover a bounded region over a finite time. First, we pack the area by disks of minimum ...
Yi Guo, Mohanakrishnan Balakrishnan
HEURISTICS
2010
13 years 5 months ago
An adaptive memory algorithm for the split delivery vehicle routing problem
Abstract The split delivery vehicle routing problem (SDVRP) relaxes routing restrictions forcing unique deliveries to customers and allows multiple vehicles to satisfy customer dem...
Rafael E. Aleman, Xinhui Zhang, Raymond R. Hill
IJCV
2007
165views more  IJCV 2007»
13 years 8 months ago
Registration of 3D Points Using Geometric Algebra and Tensor Voting
Abstract. We address the problem of finding the correspondences of two point sets in 3D undergoing a rigid transformation. Using these correspondences the motion between the two s...
Leo Reyes, Gérard G. Medioni, Eduardo Bayro...
IWPEC
2004
Springer
14 years 1 months ago
The Minimum Weight Triangulation Problem with Few Inner Points
We propose to look at the computational complexity of 2-dimensional geometric optimization problems on a finite point set with respect to the number of inner points (that is, poi...
Michael Hoffmann, Yoshio Okamoto
ML
2008
ACM
13 years 8 months ago
Large margin vs. large volume in transductive learning
Abstract. We consider a large volume principle for transductive learning that prioritizes the transductive equivalence classes according to the volume they occupy in hypothesis spa...
Ran El-Yaniv, Dmitry Pechyony, Vladimir Vapnik