5592 search results - page 90 / 1119 » On Random Betweenness Constraints |
IWOCA
2009
Springer
14 years 4 months ago
2009
Springer
The construction of covering arrays with the fewest rows remains a challenging problem. Most computational and recursive constructions result in extensive repetition of coverage. W...
CSR
2007
Springer
14 years 4 months ago
2007
Springer
Consider a family of sets and a single set, called query set. How can one quickly find a member of the family which has a maximal intersection with the query set? Strict time cons...
CORR
2010
Springer
13 years 10 months ago
2010
Springer
Consider a family of sets and a single set, called the query set. How can one quickly find a member of the family which has a maximal intersection with the query set? Time constra...
MST
2000
13 years 9 months ago
2000
In this paper we present an efficient general simulation strategy for computations designed for fully operational BSP machines of n ideal processors, on n-processor dynamic-fault-p...
INFOCOM
2003
IEEE
14 years 3 months ago
2003
IEEE
Abstract— Replacement policies for general caching applications and Web caching in particular have been discussed extensively in the literature. Many ad-hoc policies have been pr...