Sciweavers

5331 search results - page 23 / 1067
» Algebraic Methods for Optimization Problems
Sort
View
SIGMOD
1996
ACM
132views Database» more  SIGMOD 1996»
14 years 27 days ago
Cost-Based Optimization for Magic: Algebra and Implementation
Magic sets rewriting is a well-known optimization heuristic for complex decision-support queries. There can be many variants of this rewriting even for a single query, which diffe...
Praveen Seshadri, Joseph M. Hellerstein, Hamid Pir...
ICRA
2010
IEEE
121views Robotics» more  ICRA 2010»
13 years 7 months ago
On the global optimum of planar, range-based robot-to-robot relative pose estimation
Abstract— In this paper, we address the problem of determining the relative position and orientation (pose) of two robots navigating in 2D, based on known egomotion and noisy rob...
Nikolas Trawny, Stergios I. Roumeliotis
AMC
2005
112views more  AMC 2005»
13 years 8 months ago
Mechanization for solving SPP by reducing order method
In this paper, by using the theories and methods of mathematical analysis and computer algebra, a reliable algorithm of reduction of order approximation method for solving singula...
Zhenqing Li, Weiming Wang
MP
2006
134views more  MP 2006»
13 years 8 months ago
Cubic regularization of Newton method and its global performance
In this paper, we provide theoretical analysis for a cubic regularization of Newton method as applied to unconstrained minimization problem. For this scheme, we prove general local...
Yurii Nesterov, Boris T. Polyak
LPAR
2010
Springer
13 years 6 months ago
Speed-Up Techniques for Negation in Grounding
Abstract. Grounding is the task of reducing a first order formula to ground formula that is equivalent on a given universe, and is important in many kinds of problem solving and re...
Amir Aavani, Shahab Tasharrofi, Gulay Ünel, E...