3415 search results - page 200 / 683 » Lower bounds on kernelization |
126
click to vote
AUTOMATICA
2010
15 years 6 months ago
2010
The problem of target localization involves estimating the position of a target from multiple and typically noisy measurements of the target position. It is well known that the re...
129
click to vote
DCG
2010
15 years 6 months ago
2010
Begin with a set of four points in the real plane in general position. Add to this collection the intersection of all lines through pairs of these points. Iterate. Ismailescu and ...
168
click to vote
ECCC
2010
15 years 6 months ago
2010
We study a variant of the classical circuit-lower-bound problems: proving lower bounds for sampling distributions given random bits. We prove a lower bound of 1 - 1/n(1) on the st...
176
click to vote
JSAT
2006
15 years 6 months ago
2006
Cutting planes are a well-known, widely used, and very effective technique for Integer Linear Programming (ILP). However, cutting plane techniques are seldom used in PseudoBoolean...
142
click to vote
ANOR
2005
15 years 6 months ago
2005
: We consider in this paper a two-machine flowshop scheduling problem in which the first machine processes jobs individually while the second machine processes jobs in batches. The...