13987 search results - page 343 / 2798 » The Two Guards Problem |
160
click to vote
CDC
2009
IEEE
15 years 4 months ago
2009
IEEE
This paper considers the problem of reduced-order observer design. A design procedure is proposed in which the impulse response of the observer is treated as the solution of a gene...
210
click to vote
CAI
2010
Springer
15 years 4 months ago
2010
Springer
The problem of finding a constrained longest common subsequence (CLCS) for the sequences A and B with respect to the sequence P was introduced recently. Its goal is to find a longe...
197
click to vote
ANTSW
2010
Springer
15 years 1 months ago
2010
Springer
Abstract. We consider the problem of finding and maintaining communication paths in wireless mobile ad hoc networks (MANET). We consider this problem as a bi-objective problem when...
214
click to vote
JCO
2007
15 years 6 months ago
2007
We study a variant of classical scheduling, which is called scheduling with “end of sequence” information. It is known in advance that the last job has the longest processing ...
186
click to vote
CVPR
2005
IEEE
16 years 8 months ago
2005
IEEE
Assume that we have two perspective images with known intrinsic parameters except for an unknown common focal length. It is a minimally constrained problem to find the relative or...