Sciweavers

352 search results - page 47 / 71
» On the optimal reachability problem of weighted timed automa...
Sort
View
ATMOS
2007
161views Optimization» more  ATMOS 2007»
13 years 9 months ago
Periodic Railway Timetabling with Event Flexibility
This paper addresses the problem of generating conflict-free periodic train timetables for large railway networks. We follow a two level approach, where a simplified track topolo...
Gabrio Curzio Caimi, Martin Fuchsberger, Marco Lau...
INFOCOM
2012
IEEE
11 years 10 months ago
Fair background data transfers of minimal delay impact
—In this paper we present a methodology for the design of congestion control protocols for background data transfers that have a minimal delay impact on short TCP transfers and c...
Costas Courcoubetis, Antonis Dimakis
STOC
2003
ACM
126views Algorithms» more  STOC 2003»
14 years 7 months ago
A new approach to dynamic all pairs shortest paths
We study novel combinatorial properties of graphs that allow us to devise a completely new approach to dynamic all pairs shortest paths problems. Our approach yields a fully dynam...
Camil Demetrescu, Giuseppe F. Italiano
AIPS
2008
13 years 10 months ago
A Compact and Efficient SAT Encoding for Planning
In the planning-as-SAT paradigm there have been numerous recent developments towards improving the speed and scalability of planning at the cost of finding a step-optimal parallel...
Nathan Robinson, Charles Gretton, Duc Nghia Pham, ...
CPAIOR
2009
Springer
14 years 2 months ago
Optimal Interdiction of Unreactive Markovian Evaders
The interdiction problem arises in a variety of areas including military logistics, infectious disease control, and counter-terrorism. In the typical formulation of network interdi...
Alexander Gutfraind, Aric A. Hagberg, Feng Pan