2822 search results - page 169 / 565 » Mining Optimized Ranges |
146
click to vote
ALGORITHMICA
2005
15 years 4 months ago
2005
An optimal prefetching and I/O scheduling algorithm L-OPT, for parallel I/O systems, using a read-once model of block references is presented. The algorithm uses knowledge of the n...
128
click to vote
COMCOM
2010
15 years 4 months ago
2010
We offer an analytical solution for the optimal frame size of the non-muting version of the Basic Frame Slotted ALOHA collision resolution protocol for RFID networks. Previous inv...
150
click to vote
ICRA
2009
IEEE
15 years 2 months ago
2009
IEEE
Abstract-- Existing high-dimensional motion planning algorithms are simultaneously overpowered and underpowered. In domains sparsely populated by obstacles, the heuristics used by ...
172
click to vote
AAAI
2010
15 years 1 months ago
2010
Some real-world problems are partially decomposable, in that they can be decomposed into a set of coupled subproblems, that are each relatively easy to solve. However, when these ...
139
click to vote
COGSR
2011
14 years 11 months ago
2011
In bandit problems, a decision-maker must choose between a set of alternatives, each of which has a fixed but unknown rate of reward, to maximize their total number of rewards ov...