539 search results - page 27 / 108 » An Improved Upper Bound for SAT |
121
click to vote
COMPGEOM
2010
ACM
15 years 5 months ago
2010
ACM
Orthogonal range reporting is the problem of storing a set of n points in d-dimensional space, such that the k points in an axis-orthogonal query box can be reported efficiently. ...
105
click to vote
COMGEO
2011
ACM
14 years 7 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/...
AOR
2007
15 years 15 hour ago
2007
We consider the job shop scheduling problem unit−Jm, where each job is processed once on each of m given machines. Every job consists of a permutation of tasks for all machines....
130
click to vote
WIOPT
2010
IEEE
14 years 9 months ago
2010
IEEE
Abstract--Power allocation is a promising approach for optimizing the performance of mobile radio systems in interference channels. In the present paper, the non-convex objective f...
ANTS
2006
Springer
15 years 3 months ago
2006
Springer
Let P(n) denote the largest prime divisor of n, and let (x, y) be the number of integers n x with P(n) y. In this paper we present improvements to Bernstein's algorithm, whi...