Upgrading Trees Under Diameter and Budget Constraints (2000)
Victor Chepoi, Hartmut Noltemeier
Given a tree T ---- (V, E) endowed with a length function I and a cost function c, the diameter lowering problem consists in finding the reals 0 _ x(e) _ l(e),e E such that the tree obtained from T...
Modifying Edges of a Network to Obtain Short Subgraphs (2000)
Kay U. Drangmeister, Sven O. Krumke, Madhav V. Marathe, Hartmut Noltemeier, S. S. Ravi
This paper considers problems of the following type: We are given an edge weighted graph G = (V; E). It is assumed that each edge e of the given network has an associated function c e that species...
Practical Strategies for Hypotheses Elimination on the Self-Localization Problem (1999)
Martin Buck, Hartmut Noltemeier
We take a look at the second part of the robot-selflocalizationproblem. The hypotheses generated in a solution of the first part of the problem will be efficient reduced with the movement of the...
Using Polygon Distances for Localization (1998)
Oliver Karch, Hartmut Noltemeier, Thomas Wahl
We consider the localization problem for a robot, which has only a range sensor and a polygonal map of its environment. An idealized version of this problem, where the robot additionally has a...
Robot LocalizationTheory and Practice (1997)
Oliver Karch, Hartmut Noltemeier
We consider the rst stage of the robot localization problem described as follows: a robot is at an unknown position in an indoor-environment and has to do a complete relocalization, that is, it has...
Dynamic Environmental Modeling By The C-Tree (1997)
Knut Verbarg, Hartmut Noltemeier
We introduce an efficient and robust spatial index to support a set of different queries, which is developed from Gunther's Celltree 6 and the Monotonous Bisector Tree 11;16 . In practice, huge...
Robot Localization: Theory and Implementation (1997)
Oliver Karch, Hartmut Noltemeier, Thomas Wahl
Introduction We consider the robot localization problem described as: a robot is at an unknown position in an indoor-environment and has to determine where it is located. This problem occurs if, for...
Incluye bibliografía
Sensitivetatsanalyse bei diskreten linearen Optimierungsproblemen / [von] H. Noltemeier (1970)
Incluye bibliografía
Parametrische diskrete lineare Programme. (1969)
Karlsruhe, F. f. Naturwiss. I, Diss. v. 19. Dez. 1969.