188 search results - page 17 / 38 » Finding Best k Policies |
ACMICEC
2007
ACM
14 years 1 months ago
2007
ACM
When new technologies for production and dissemination of information emerge and are adopted, we see a dramatic increase in the quantity of information that is made available for ...
ADBIS
2001
Springer
14 years 1 months ago
2001
Springer
In this paper, the most appropriate buffer structure, page replacement policy and buffering scheme for closest pairs queries, where both spatial datasets are stored in R-trees, are...
SODA
2010
ACM
14 years 7 months ago
2010
ACM
The hypergraph matching problem is to find a largest collection of disjoint hyperedges in a hypergraph. This is a well-studied problem in combinatorial optimization and graph theo...
AAAI
2008
14 years 5 days ago
2008
This paper examines, by argument, the dynamics of sequences of behavioural choices made, when non-cooperative restricted-memory agents learn in partially observable stochastic gam...
DAC
2007
ACM
14 years 10 months ago
2007
ACM
Despite the impressive progress of logic synthesis in the past decade, finding the best architecture for a given circuit still remains an open problem and largely unsolved. In mos...