Sciweavers

4894 search results - page 924 / 979
» The Guarding Problem - Complexity and Approximation
Sort
View
GRAPHICSINTERFACE
2008
14 years 11 months ago
Background estimation from non-time sequence images
We address the problem of reconstructing the background of a scene from a set of photographs featuring several occluding objects. We assume that the photographs are obtained from ...
Miguel Granados, Hans-Peter Seidel, Hendrik P. A. ...
IM
2007
14 years 11 months ago
Business-Driven Optimization of Policy-Based Management solutions
— 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 ...
Issam Aib, Raouf Boutaba
RSS
2007
119views Robotics» more  RSS 2007»
14 years 11 months ago
Emergent Task Allocation for Mobile Robots
— 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...
Nuzhet Atay, O. Burçhan Bayazit
AAAI
2006
14 years 11 months ago
Action Selection in Bayesian Reinforcement Learning
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...
Tao Wang
SODA
2004
ACM
128views Algorithms» more  SODA 2004»
14 years 11 months ago
Equivalence of local treewidth and linear local treewidth and its algorithmic applications
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 ...
Erik D. Demaine, Mohammad Taghi Hajiaghayi