1272 search results - page 34 / 255 » The Set Cover with Pairs Problem |
96
Voted
COLING
2008
15 years 2 months ago
2008
We generalize Uno and Yagiura's algorithm for finding all common intervals of two permutations to the setting of two sequences with many-to-many alignment links across the tw...
98
Voted
AUTOMATICA
2006
15 years 22 days ago
2006
This paper revisits a well-known synthesis problem in iterative learning control, where the objective is to optimize a performance criterion over a class of causal iterations. The...
87
Voted
ICRA
2005
IEEE
15 years 6 months ago
2005
IEEE
— In this paper we address the problem of generating a motion strategy to find an object in a known 3-D environment as quickly as possible on average. We use a sampling scheme t...
113
click to vote
LOPSTR
2009
Springer
15 years 7 months ago
2009
Springer
In this work, we first consider a goal-oriented extension of the dependency pair framework for proving termination w.r.t. a given set of initial terms. Then, we introduce a new re...
99
Voted
MST
2010
14 years 11 months ago
2010
We study the following variant of the bin covering problem. We are given a set of unit sized items, where each item has a color associated with it. We are given an integer paramet...