Sciweavers

880 search results - page 47 / 176
» The SLAM problem: a survey
Sort
View
JGO
2008
90views more  JGO 2008»
15 years 6 months ago
A scaling algorithm for polynomial constraint satisfaction problems
Abstract. Good scaling is an essential requirement for the good behavior of many numerical algorithms. In particular, for problems involving multivariate polynomials, a change of s...
Ferenc Domes, Arnold Neumaier
STACS
2010
Springer
16 years 1 months ago
Reflections on Multivariate Algorithmics and Problem Parameterization
Research on parameterized algorithmics for NP-hard problems has steadily grown over the last years. We survey and discuss how parameterized complexity analysis naturally develops i...
Rolf Niedermeier
DFG
2009
Springer
16 years 23 days ago
Iterative Compression for Exactly Solving NP-Hard Minimization Problems
Abstract. We survey the conceptual framework and several applications of the iterative compression technique introduced in 2004 by Reed, Smith, and Vetta. This technique has proven...
Jiong Guo, Hannes Moser, Rolf Niedermeier
CORR
2007
Springer
139views Education» more  CORR 2007»
15 years 6 months ago
Algorithmic Semi-algebraic Geometry and Topology -- Recent Progress and Open Problems
Abstract. We give a survey of algorithms for computing topological invariants of semi-algebraic sets with special emphasis on the more recent developments in designing algorithms f...
Saugata Basu
ACS
2007
15 years 6 months ago
More on Configurations in Priestley Spaces, and Some New Problems
Abstract. Prohibiting configurations (≡ induced finite connected posets) in Priestley spaces and properties of the associated classes of distributive lattices, and the related ...
Richard N. Ball, Ales Pultr, Jirí Sichler