Sciweavers

3678 search results - page 312 / 736
» On the Stable Paths Problem
Sort
View
ADG
2000
Springer
110views Mathematics» more  ADG 2000»
15 years 11 months ago
Decision Complexity in Dynamic Geometry
Abstract. Geometric straight-line programs [5, 8] can be used to model geometric constructions and their implicit ambiguities. In this paper we discuss the complexity of deciding w...
Ulrich Kortenkamp, Jürgen Richter-Gebert
JDA
2007
98views more  JDA 2007»
15 years 6 months ago
Admission control with advance reservations in simple networks
In the admission control problem we are given a network and a set of connection requests, each of which is associated with a path, a time interval, a bandwidth requirement, and a ...
Dror Rawitz
ICRA
2010
IEEE
117views Robotics» more  ICRA 2010»
15 years 5 months ago
Online navigation summaries
— Our objective is to find a small set of images that summarize a robot’s visual experience along a path. We present a novel on-line algorithm for this task. This algorithm is...
Yogesh Girdhar, Gregory Dudek
CRV
2011
IEEE
352views Robotics» more  CRV 2011»
14 years 6 months ago
Conformative Filter: A Probabilistic Framework for Localization in Reduced Space
— Algorithmic problem reduction is a fundamental approach to problem solving in many fields, including robotics. To solve a problem using this scheme, we must reduce the problem...
Chatavut Viriyasuthee, Gregory Dudek
ESA
2007
Springer
118views Algorithms» more  ESA 2007»
16 years 28 days ago
A New ILP Formulation for 2-Root-Connected Prize-Collecting Steiner Networks
We consider the real-world problem of extending a given infrastructure network in order to connect new customers. By representing the infrastructure by a single root node, this pro...
Markus Chimani, Maria Kandyba, Petra Mutzel