3678 search results - page 143 / 736 » On the Stable Paths Problem |
127
Voted
NETWORKS
2006
15 years 1 months ago
2006
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...
122
Voted
ICALP
2010
Springer
15 years 6 months ago
2010
Springer
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...
91
Voted
HAPTICS
2003
IEEE
15 years 6 months ago
2003
IEEE
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...
61
Voted
JCSS
1998
15 years 24 days ago
1998
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 ...
105
Voted
LICS
2010
IEEE
14 years 11 months ago
2010
IEEE
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...