Sciweavers

2343 search results - page 434 / 469
» The Locomotive Routing Problem
Sort
View
CCGRID
2001
IEEE
14 years 1 months ago
Group Communication in Differentiated Services Networks
The Differentiated Services (DiffServ) approach will also bring benefits for multicast applications which need quality of service support. For instance, a highly reliable multicas...
Roland Bless, Klaus Wehrle
FOCS
1995
IEEE
14 years 1 months ago
Disjoint Paths in Densely Embedded Graphs
We consider the following maximum disjoint paths problem (mdpp). We are given a large network, and pairs of nodes that wish to communicate over paths through the network — the g...
Jon M. Kleinberg, Éva Tardos
ATAL
2008
Springer
13 years 12 months ago
No-regret learning and a mechanism for distributed multiagent planning
We develop a novel mechanism for coordinated, distributed multiagent planning. We consider problems stated as a collection of single-agent planning problems coupled by common soft...
Jan-P. Calliess, Geoffrey J. Gordon
COMPGEOM
2008
ACM
13 years 11 months ago
Maximum thick paths in static and dynamic environments
We consider the problem of finding a maximum number of disjoint paths for unit disks moving amidst static or dynamic obstacles. For the static case we give efficient exact algorit...
Esther M. Arkin, Joseph S. B. Mitchell, Valentin P...
ATMOS
2008
103views Optimization» more  ATMOS 2008»
13 years 11 months ago
IP-based Techniques for Delay Management with Priority Decisions
Delay management is an important issue in the daily operations of any railway company. The task is to update the planned timetable to a disposition timetable in such a way that the...
Michael Schachtebeck, Anita Schöbel