4894 search results - page 602 / 979 » The Guarding Problem - Complexity and Approximation |
161
click to vote
DIALM
2008
ACM
15 years 6 months ago
2008
ACM
In opportunistic forwarding, a node randomly relays packets to one of its neighbors based on local information, without the knowledge of global topology. Each intermediate node co...
131
click to vote
ECAI
2008
Springer
15 years 6 months ago
2008
Springer
In many practical reinforcement learning problems, the state space is too large to permit an exact representation of the value function, much less the time required to compute it. ...
113
click to vote
NIPS
2007
15 years 5 months ago
2007
Support Vector Machines (SVMs) suffer from a widely recognized scalability problem in both memory use and computational time. To improve scalability, we have developed a parallel ...
177
click to vote
NIPS
2007
15 years 5 months ago
2007
Bayesian Reinforcement Learning has generated substantial interest recently, as it provides an elegant solution to the exploration-exploitation trade-off in reinforcement learning...
145
click to vote
RSS
2007
15 years 5 months ago
2007
— In probabilistic mobile robotics, the development of measurement models plays a crucial role as it directly influences the efficiency and the robustness of the robot’s perf...