5624 search results - page 173 / 1125 » On Conditional Covering Problem |
200
click to vote
NETWORKS
2006
15 years 6 months ago
2006
We study capacitated network flow problems with supplies and demands defined on a countably infinite collection of nodes having finite degree. This class of network flow models in...
144
click to vote
CDC
2009
IEEE
15 years 11 months ago
2009
IEEE
We use viability techniques for solving Dirichlet problems with inequality constraints (obstacles) for a class of Hamilton-Jacobi equations. The hypograph of the “solution” is ...
184
click to vote
CVPR
2009
IEEE
17 years 1 months ago
2009
IEEE
Image parsing remains difficult due to the need to combine
local and contextual information when labeling a
scene. We approach this problem by using the epitome as a
prior over ...
161
click to vote
COLT
2007
Springer
16 years 21 days ago
2007
Springer
Abstract. Considering one-dimensional continuum-armed bandit problems, we propose an improvement of an algorithm of Kleinberg and a new set of conditions which give rise to improve...
153
click to vote
AAAI
2008
15 years 8 months ago
2008
This paper addresses the problem of plan recognition for multi-agent teams. Complex multi-agent tasks typically require dynamic teams where the team membership changes over time. ...