497 search results - page 41 / 100 » Approximating max-min linear programs with local algorithms |
PLDI
2003
ACM
15 years 3 months ago
2003
ACM
Profiling can accurately analyze program behavior for select data inputs. We show that profiling can also predict program locality for inputs other than profiled ones. Here loc...
KDD
2009
ACM
15 years 10 months ago
2009
ACM
Mining discrete patterns in binary data is important for subsampling, compression, and clustering. We consider rankone binary matrix approximations that identify the dominant patt...
PADL
2010
Springer
14 years 11 months ago
2010
Springer
Newer Prolog implementations commonly offer support for multi-threading, and have also begun to offer support for tabling. However, most implementations do not yet integrate tablin...
CORR
2010
Springer
14 years 7 months ago
2010
Springer
The lift-and-project closure is the relaxation obtained by computing all lift-and-project cuts from the initial formulation of a mixed integer linear program or equivalently by co...
FSTTCS
2007
Springer
15 years 4 months ago
2007
Springer
We consider scheduling problems in which a job consists of components of different types to be processed on m machines. Each machine is capable of processing components of a singl...