1461 search results - page 106 / 293 » The Cost of Cache-Oblivious Searching |
143
click to vote
AAAI
2006
15 years 7 months ago
2006
Much of the work on opponent modeling for game tree search has been unsuccessful. In two-player, zero-sum games, the gains from opponent modeling are often outweighed by the cost ...
168
click to vote
GLOBECOM
2008
IEEE
15 years 7 months ago
2008
IEEE
—In this paper, we present a near ML-achieving sphere search technique that reduces the number of search operations significantly over existing sphere decoding (SD) algorithms. ...
161
click to vote
JSS
2008
15 years 6 months ago
2008
The high cost of software maintenance could be reduced by automatically improving the design of object-oriented programs without altering their behaviour. We have constructed a so...
169
click to vote
HEURISTICS
2002
15 years 6 months ago
2002
Given a graph G, the Shortest Capacitated Paths Problem (SCPP) consists of determining a set of paths of least total length, linking given pairs of vertices in G, and satisfying c...
156
click to vote
EMNLP
2010
15 years 4 months ago
2010
Syntax-based translation models should in principle be efficient with polynomially-sized search space, but in practice they are often embarassingly slow, partly due to the cost of...