1347 search results - page 53 / 270 » On the Structure of the Minimum Time Function |
96
Voted
GECCO
2007
Springer
15 years 6 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...
95
Voted
MST
1998
15 years 5 days 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 ...
94
Voted
AINA
2004
IEEE
15 years 4 months 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...
107
Voted
RTAS
2005
IEEE
15 years 6 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...
87
Voted
VLDB
2005
ACM
15 years 6 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...