214 search results - page 12 / 43 » Perfect and Almost Perfect Sequences |
152
click to vote
ICRA
2007
IEEE
15 years 10 months ago
2007
IEEE
Abstract— For the multi-robot coverage problem deterministic deliberative as well as probabilistic approaches have been proposed. Whereas deterministic approaches usually provide...
134
click to vote
FCT
2007
Springer
15 years 7 months ago
2007
Springer
We study the multi-dimensional version of the bin packing problem with conflicts. We are given a set of squares V = {1, 2, . . . , n} with sides s1, s2, . . . , sn [0, 1] and a co...
140
Voted
ACTA
2008
15 years 3 months ago
2008
We study the two-dimensional version of the bin packing problem with conflicts. We are given a set of (two-dimensional) squares V = {1, 2, . . . , n} with sides s1, s2 . . . , sn ...
108
Voted
TIT
2008
15 years 3 months ago
2008
Costa's celebrated "writing on dirty paper" (WDP) shows that the powerconstrained channel Y = X + S + Z, with Gaussian Z, has the same capacity as the standard AWGN...
132
click to vote
JIRS
2000
15 years 3 months ago
2000
: Formula One racing is one of the most fascinating sports ever, it is a perfect combination of high speed, technology, pressure and danger. One problem associated with car racing ...