2095 search results - page 260 / 419 » Improved pebbling bounds |
124
click to vote
COMBINATORICA
2004
15 years 6 months ago
2004
Let p [1, [ and cp = maxa[0,1]((1 - a)ap + a(1 - a)p)1/p. We prove that the known upper bound lindiscp(A) cp for the Lp linear discrepancy of a totally unimodular matrix A is as...
145
click to vote
COMBINATORICA
2004
15 years 6 months ago
2004
We present a new method to show concentration of the upper tail of random variables that can be written as sums of variables with plenty of independence. We compare our method with...
179
click to vote
ALGORITHMICA
2000
15 years 6 months ago
2000
We present an O(NV +V 3) time algorithm for enumerating all spanning trees of a directed graph. This improves the previous best known bound of O(NE + V + E) [1] when V 2 = o(N), wh...
146
click to vote
CPC
2002
15 years 6 months ago
2002
We study a model motivated by the minesweeper game. In this model one starts with percolation of mines on the sites of the lattice Zd , and then tries to find an infinite path of ...
193
click to vote
EOR
2002
15 years 6 months ago
2002
We present a genetic algorithm for heuristically solving a cost minimization problem applied to communication networks with threshold based discounting. The network model assumes t...