1347 search results - page 53 / 270 » On the Structure of the Minimum Time Function |
GECCO
2007
Springer
14 years 3 months ago
2007
Springer
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...
MST
1998
13 years 8 months ago
1998
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 ...
AINA
2004
IEEE
14 years 23 days ago
2004
IEEE
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...
RTAS
2005
IEEE
14 years 2 months ago
2005
IEEE
The increasing popularity of high-volume performancecritical Internet applications calls for a scalable server design that allows meeting individual response-time guarantees. Cons...
VLDB
2005
ACM
14 years 2 months ago
2005
ACM
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...