Sciweavers

279 search results - page 3 / 56
» Type-II Optimal Polynomial Bases
Sort
View
ICRA
2007
IEEE
130views Robotics» more  ICRA 2007»
13 years 11 months ago
Mobile Robot Localization based on a Polynomial Approach
— This paper introduces a new analytical algorithm to perform the localization of a mobile robot using odometry and laser readings. Based on a polynomial approach, the proposed a...
C. Manes, Agostino Martinelli, F. Martinelli, P. P...
IJCAI
2001
13 years 6 months ago
R-MAX - A General Polynomial Time Algorithm for Near-Optimal Reinforcement Learning
R-max is a very simple model-based reinforcement learning algorithm which can attain near-optimal average reward in polynomial time. In R-max, the agent always maintains a complet...
Ronen I. Brafman, Moshe Tennenholtz
ICCV
2011
IEEE
12 years 5 months ago
Optimizing Polynomial Solvers for Minimal Geometry Problems
In recent years polynomial solvers based on algebraic geometry techniques, and specifically the action matrix method, have become popular for solving minimal problems in computer...
Oleg Naroditsky, Kostas Daniilidis
CASES
2004
ACM
13 years 10 months ago
Analytical computation of Ehrhart polynomials: enabling more compiler analyses and optimizations
Many optimization techniques, including several targeted specifically at embedded systems, depend on the ability to calculate the number of elements that satisfy certain conditio...
Sven Verdoolaege, Rachid Seghir, Kristof Beyls, Vi...
TCS
2008
13 years 5 months ago
Approximate GCDs of polynomials and sparse SOS relaxations
The problem of computing approximate GCDs of several polynomials with real or complex coefficients can be formulated as computing the minimal perturbation such that the perturbed ...
Bin Li, Jiawang Nie, Lihong Zhi