Sciweavers

356 search results - page 33 / 72
» Approximation schemes for the Min-Max Starting Time Problem
Sort
View
STOC
2006
ACM
186views Algorithms» more  STOC 2006»
14 years 8 months ago
A subset spanner for Planar graphs, : with application to subset TSP
Let > 0 be a constant. For any edge-weighted planar graph G and a subset S of nodes of G, there is a subgraph H of G of weight a constant times that of the minimum Steiner tree...
Philip N. Klein
EOR
2008
133views more  EOR 2008»
13 years 7 months ago
Vehicle routing with dynamic travel times: A queueing approach
Transportation is an important component of supply chain competitiveness since it plays a major role in the inbound, inter-facility, and outbound logistics. In this context, assig...
Tom Van Woensel, Laoucine Kerbache, Herbert Perema...
ECML
2007
Springer
13 years 11 months ago
Efficient Continuous-Time Reinforcement Learning with Adaptive State Graphs
Abstract. We present a new reinforcement learning approach for deterministic continuous control problems in environments with unknown, arbitrary reward functions. The difficulty of...
Gerhard Neumann, Michael Pfeiffer, Wolfgang Maass
ROBOCOMM
2007
IEEE
14 years 1 months ago
Minimal energy path planning for wireless robots
—For the first time, the problem of optimizing energy for communication and motion is investigated. We consider a single mobile robot with continuous high bandwidth wireless com...
Chia-Ching Ooi, Christian Schindelhauer
COMPGEOM
2011
ACM
12 years 11 months ago
Comparing distributions and shapes using the kernel distance
Starting with a similarity function between objects, it is possible to define a distance metric (the kernel distance) on pairs of objects, and more generally on probability distr...
Sarang C. Joshi, Raj Varma Kommaraju, Jeff M. Phil...