3415 search results - page 298 / 683 » Lower bounds on kernelization |
166
click to vote
COR
2008
15 years 6 months ago
2008
An approach is proposed for generating homogenous three-staged cutting patterns for the constrained two-dimensional guillotinecutting problems of rectangles. It is based on branch...
171
click to vote
JSAC
2010
15 years 5 months ago
2010
Abstract—In high density perpendicular magnetic recording channels, nonlinear transition shift (NLTS) is one of the distortions that can degrade the system performance. Write pre...
178
click to vote
MFCS
2010
Springer
15 years 5 months ago
2010
Springer
We study observation-based strategies for partially-observable Markov decision processes (POMDPs) with parity objectives. An observationbased strategy relies on partial information...
170
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
In terabit-density magnetic recording, several bits of data can be replaced by the values of their neighbors in the storage medium. As a result, errors in the medium are dependent ...
183
click to vote
JGO
2010
15 years 1 months ago
2010
The best known method to find exact or at least -approximate solutions to polynomial programming problems is the spatial Branch-and-Bound algorithm, which rests on computing lower...