1566 search results - page 208 / 314 » On a Cone Covering Problem |
163
Voted
JSAT
2010
14 years 11 months ago
2010
In this paper we analyze three well-known preprocessors for Max-SAT. The first preprocessor is based on the so-called variable saturation. The second preprocessor is based on the ...
129
click to vote
CORR
2011
Springer
14 years 8 months ago
2011
Springer
—In a data center network, for example, it is quite often to use controllers to manage resources in a centralized manner. Centralized control, however, imposes a scalability prob...
151
click to vote
SIGMOD
2011
ACM
14 years 7 months ago
2011
ACM
With the proliferation of geo-positioning and geo-tagging, spatial web objects that possess both a geographical location and a textual description are gaining in prevalence, and s...
137
click to vote
STOC
2004
ACM
16 years 4 months ago
2004
ACM
We present a probabilistic analysis for a large class of combinatorial optimization problems containing, e.g., all binary optimization problems defined by linear constraints and a...
137
click to vote
DCC
2007
IEEE
16 years 3 months ago
2007
IEEE
The low-density attack proposed by Lagarias and Odlyzko is a powerful algorithm against the subset sum problem. The improvement algorithm due to Coster et al. would solve almost a...