110 search results - page 13 / 22 » New Upper Bounds for Maximum Satisfiability |
105
click to vote
COMGEO
2011
ACM
14 years 6 months ago
2011
ACM
We prove that n cops can capture (that is, some cop can get less than unit distance from) a robber in a continuous square region with side length less than √ 5n and hence that n/...
104
click to vote
CORR
2010
Springer
14 years 12 months ago
2010
Springer
We investigate the extent to which price updates can increase the revenue of a seller with little prior information on demand. We study prior-free revenue maximization for a selle...
102
click to vote
COMPGEOM
2004
ACM
15 years 5 months ago
2004
ACM
A geometric graph is a simple graph G = (V, E) with an embedding of the set V in the plane such that the points that represent V are in general position. A geometric graph is said...
ECCC
2010
14 years 12 months ago
2010
Suppose a decision maker has to purchase a commodity over time with varying prices and demands. In particular, the price per unit might depend on the amount purchased and this pri...
114
click to vote
STOC
2005
ACM
16 years 2 days ago
2005
ACM
We introduce a new graph parameter, called the Grothendieck constant of a graph G = (V, E), which is defined as the least constant K such that for every A : E R, sup f:V S|V |-1 ...