Search Sciweavers | Sciweavers

We evaluate the average-case performance of three approximation algorithms for online non-clairvoyant scheduling of parallel tasks with precedence constraints. We show that for a ...

Keqin Li

claim paper

Read More »

click to vote

IPL
2008

98views more IPL 2008»

Bit-parallel string matching under Hamming distance in O(n[m/w]) worst case time

14 years 9 months ago

Download www.cs.uku.fi

Given two strings, a pattern P of length m and a text T of length n over some alphabet , we consider the string matching problem under k mismatches. The well

Szymon Grabowski, Kimmo Fredriksson

claim paper

Read More »

click to vote

DM
2002

78views more DM 2002»

On the half?half case of the Zarankiewicz problem

14 years 9 months ago

Download www.math.sc.edu

Consider the minimum number f(m, n) of zeroes in a 2m

Jerrold R. Griggs, Chih-Chang Ho

claim paper