16404 search results - page 804 / 3281 » A set coverage problem |
191
click to vote
PRICAI
2010
Springer
15 years 6 months ago
2010
Springer
Abstract. We consider the problem of computing optimal plans for propositional planning problems with action costs. In the spirit of leveraging advances in general-purpose automate...
226
click to vote
TCS
2010
15 years 5 months ago
2010
We study the following variant of the bin packing problem. We are given a set of items, where each item has a (non-negative) size and a color. We are also given an integer paramet...
303
click to vote
CDC
2009
IEEE
15 years 5 months ago
2009
IEEE
Abstract-- We consider a wireless system with a small number of delay constrained users and a larger number of users without delay constraints. We develop a scheduling algorithm th...
193
click to vote
FOSSACS
2012
Springer
14 years 3 months ago
2012
Springer
We consider concurrent games played on graphs, in which each player has several qualitative (e.g. reachability or B¨uchi) objectives, and a preorder on these objectives (for insta...
183
click to vote
CVPR
2004
IEEE
16 years 9 months ago
2004
IEEE
In this paper, we present a new segment-based stereo matching algorithm using graph cuts. In our approach, the reference image is divided into non-overlapping homogeneous segments...