359 search results - page 44 / 72 » Online Algorithms for Disk Graphs |
GD
1998
Springer
15 years 4 months ago
1998
Springer
We consider the problem of visualizing interconnections in railway systems. Given time tables from systems with thousands of trains, we are to visualize basic properties of the co...
104
click to vote
ICC
2007
IEEE
15 years 6 months ago
2007
IEEE
—Multichannel communication in a Wireless Mesh Network with routers having multiple radio interfaces significantly enhances the network capacity. Efficient channel assignment an...
110
click to vote
CORR
2011
Springer
14 years 3 months ago
2011
Springer
A hitting set for a collection of sets is a set that has a nonempty intersection with each set in the collection; the hitting set problem is to find a hitting set of minimum card...
121
click to vote
DIALM
2004
ACM
15 years 5 months ago
2004
ACM
Coping with mobility and dynamism is one of the biggest challenges in ad hoc networks. An essential requirement for such networks is a service that can establish communication ses...
118
click to vote
ECML
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. We present a new reinforcement learning approach for deterministic continuous control problems in environments with unknown, arbitrary reward functions. The difficulty of...