1461 search results - page 41 / 293 » The Cost of Cache-Oblivious Searching |
AAAI
2000
15 years 1 months ago
2000
Reinforcement learning (RL) can be impractical for many high dimensional problems because of the computational cost of doing stochastic search in large state spaces. We propose a ...
CGF
2008
14 years 12 months ago
2008
This work emerged from the following observation: usual search procedures for octrees start from the root to retrieve the data stored at the leaves. But since the leaves are the fa...
COMMA
2008
15 years 1 months ago
2008
Abstract Classical propositional logic is an appealing option for modelling argumentation but the computational viability of generating an argument is an issue. Here we propose ame...
107
click to vote
IPPS
2007
IEEE
15 years 6 months ago
2007
IEEE
We study efficient query processing in distributed web search engines with global index organization. The main performance bottleneck in this case is due to the large amount of i...
117
click to vote
GECCO
2005
Springer
15 years 5 months ago
2005
Springer
Many non-cooperative settings that could potentially be studied using game theory are characterized by having very large strategy spaces and payoffs that are costly to compute. Be...