2310 search results - page 244 / 462 » The selection efficiency of tournaments |
ANOR
2004
13 years 10 months ago
2004
Many real-world AI problems (e.g. in configuration) are weakly constrained, thus requiring a mechanism for characterizing and finding the preferred solutions. Preferencebased sear...
JACM
1998
13 years 10 months ago
1998
Given a collection Ᏺ of subsets of S ϭ {1, . . . , n}, set cover is the problem of selecting as few as possible subsets from Ᏺ such that their union covers S, and max k-cover ...
TSMC
2002
13 years 10 months ago
2002
Due to its fixed assignment nature, the well-known time division multiple access (TDMA) protocol suffers from poor performance when the offered traffic is bursty. In this paper, an...
VLDB
2002
ACM
13 years 10 months ago
2002
ACM
All existing proposals for querying XML (e.g., XQuery) rely on a pattern-specification language that allows (1) path navigation and branching through the label structure of the XM...
VLDB
2002
ACM
13 years 10 months ago
2002
ACM
This paper introduces MICP, a novel multiversion integrated cache replacement and prefetching algorithm designed for efficient cache and transaction management in hybrid data deli...