352 search results - page 47 / 71 » On the optimal reachability problem of weighted timed automa... |
162
click to vote
ATMOS
2007
15 years 7 months ago
2007
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...
179
click to vote
INFOCOM
2012
IEEE
13 years 8 months ago
2012
IEEE
—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...
145
click to vote
STOC
2003
ACM
16 years 6 months ago
2003
ACM
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...
173
click to vote
AIPS
2008
15 years 8 months ago
2008
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...
139
click to vote
CPAIOR
2009
Springer
16 years 21 days ago
2009
Springer
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...