4843 search results - page 914 / 969 » The Shortcut Problem - Complexity and Approximation |
140
click to vote
IM
2007
15 years 4 months ago
2007
— We consider whether the off-line compilation of a set of Service Level Agreements (SLAs) into low-level management policies can lead to the runtime maximization of the overall ...
128
click to vote
RSS
2007
15 years 4 months ago
2007
— Multi-robot systems require efficient and accurate planning in order to perform mission-critical tasks. However, algorithms that find the optimal solution are usually computa...
142
click to vote
AAAI
2006
15 years 4 months ago
2006
My research attempts to address on-line action selection in reinforcement learning from a Bayesian perspective. The idea is to develop more effective action selection techniques b...
122
click to vote
SODA
2004
ACM
15 years 4 months ago
2004
ACM
We solve an open problem posed by Eppstein in 1995 [14, 15] and re-enforced by Grohe [16, 17] concerning locally bounded treewidth in minor-closed families of graphs. A graph has ...
146
click to vote
WSCG
2004
15 years 4 months ago
2004
Several sophisticated methods are available for efficient rendering of out-of-core terrain data sets. For huge data sets the use of preprocessed tiles has proven to be more effici...