1022 search results - page 163 / 205 » New models and algorithms for programmable networks |
78
Voted
SCHEDULING
2008
14 years 12 months ago
2008
Suppose we are given a schedule of train movements over a rail network into which a new train is to be included. The origin and the destination are specified for the new train; it...
SAGT
2009
Springer
15 years 7 months ago
2009
Springer
We study Nash equilibria and the price of anarchy in the context of flows over time. Many results on static routing games have been obtained over the last ten years. In flows ov...
97
Voted
COSIT
1995
Springer
15 years 4 months ago
1995
Springer
: Various algorithms have been proposed for the determination of the optimum paths in line networks. Moving in space is a far more complex problem, where research has been scarce. ...
100
click to vote
UAI
1997
15 years 1 months ago
1997
Much recent research in decision theoretic planning has adopted Markov decision processes (MDPs) as the model of choice, and has attempted to make their solution more tractable by...
111
Voted
AINA
2007
IEEE
15 years 6 months ago
2007
IEEE
In the Ad-Hoc InfoWare project, we develop a delay tolerant event notification service for sparse Mobile Ad-Hoc Networks for emergency and rescue operations. In most event notific...