Sciweavers

3678 search results - page 143 / 736
» On the Stable Paths Problem
Sort
View
NETWORKS
2006
15 years 6 months ago
Extreme point characterizations for infinite network flow problems
We study capacitated network flow problems with supplies and demands defined on a countably infinite collection of nodes having finite degree. This class of network flow models in...
H. Edwin Romeijn, Dushyant Sharma, Robert L. Smith
ICALP
2010
Springer
15 years 11 months ago
Network Design via Core Detouring for Problems without a Core
Some of the currently best-known approximation algorithms for network design are based on random sampling. One of the key steps of such algorithms is connecting a set of source nod...
Fabrizio Grandoni, Thomas Rothvoß
HAPTICS
2003
IEEE
15 years 11 months ago
Path-Following Control for Dissipative Passive Haptic Displays
This paper addresses the problem of following an arbitrary path with a dissipative passive haptic display. Such a display has energetically passive actuators; all motive energy mu...
Davin K. Swanson, Wayne J. Book
JCSS
1998
51views more  JCSS 1998»
15 years 6 months ago
Randomized Query Processing in Robot Path Planning
d Abstract) LYDIA E. KAVRAKI   JEAN-CLAUDE LATOMBE   RAJEEV MOTWANI ¡ PRABHAKAR RAGHAVAN ¢ The subject of this paper is the analysis of a randomized preprocessing scheme that ...
Lydia E. Kavraki, Jean-Claude Latombe, Rajeev Motw...
LICS
2010
IEEE
15 years 4 months ago
Breaking Paths in Atomic Flows for Classical Logic
This work belongs to a wider effort aimed at eliminating syntactic bureaucracy from proof systems. In this paper, we present a novel cut elimination procedure for classical propos...
Alessio Guglielmi, Tom Gundersen, Lutz Straß...