We analyze the performance of evolutionary algorithms on various matroid optimization problems that encompass a vast number of efficiently solvable as well as NP-hard combinatoria...
We de ne the sharply bounded hierarchy, SBH(QL), a hierarchy of classes within P, using quasilinear-time computation and quanti cation over strings of length logn. It generalizes ...
Stephen A. Bloch, Jonathan F. Buss, Judy Goldsmith
2004, Chang et al. suggested an approach that solves the problem of secret sharing with access structures in a hierarchy. They used the concept of discrete logarithmto reuse shado...
The increasing popularity of high-volume performancecritical Internet applications calls for a scalable server design that allows meeting individual response-time guarantees. Cons...
In an “uncertain database”, an object o is associated with a multi-dimensional probability density function (pdf), which describes the likelihood that o appears at each positi...
Yufei Tao, Reynold Cheng, Xiaokui Xiao, Wang Kay N...