2796 search results - page 57 / 560 » The coolest path problem |
101
click to vote
ICMCS
2009
IEEE
14 years 9 months ago
2009
IEEE
Distributed Multi-party/Multi-stream systems require a multicast subnetwork capable of satisfying QoS constraints such as Delay and Delay Variation Bound so that the messages reac...
AAAI
2012
13 years 2 months ago
2012
We describe a new sound and complete method for compiling contingent planning problems with sensing actions into classical planning. Our method encodes conditional plans within a ...
WG
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. We present hardness results, approximation heuristics, and exact algorithms for bottleneck labeled optimization problems arising in the context of graph theory. This long...
ICFP
2008
ACM
15 years 11 months ago
2008
ACM
Optimal path queries are queries to obtain an optimal path specified by a given criterion of optimality. There have been many studies to give efficient algorithms for classes of o...
SCHEDULING
2008
14 years 11 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...