2095 search results - page 51 / 419 » Improved pebbling bounds |
STOC
2003
ACM
14 years 10 months ago
2003
ACM
Given a database of n points in {0, 1}d, the partial match problem is: In response to a query x in {0, 1, }d, find a database point y such that for every i whenever xi = , we have...
STACS
2005
Springer
14 years 3 months ago
2005
Springer
Abstract. The dynamic page migration problem [4] is defined in a distributed network of n mobile nodes sharing one indivisible memory page of size D. During runtime, the nodes can...
LSSC
2001
Springer
14 years 2 months ago
2001
Springer
Abstract. Quasi-Monte Carlo methods are based on the idea that random Monte Carlo techniques can often be improved by replacing the underlying source of random numbers with a more ...
TSP
2008
13 years 9 months ago
2008
Since the seminal work of Stein in the 1950s, there has been continuing research devoted to improving the total meansquared error (MSE) of the least-squares (LS) estimator in the l...
CP
2005
Springer
14 years 3 months ago
2005
Springer
This paper describes a hybrid approach to solving large-scale constraint satisfaction and optimization problems. It describes a hybrid algorithm for integer linear programming whic...