13306 search results - page 2538 / 2662 » Theoretical Computer Science |
148
click to vote
ICRA
2008
IEEE
16 years 24 days ago
2008
IEEE
Abstract— We propose a new approximate algorithm, LAJIV (Lookahead J-MDP Information Value), to solve Oracular Partially Observable Markov Decision Problems (OPOMDPs), a special ...
166
click to vote
MICRO
2008
IEEE
16 years 23 days ago
2008
IEEE
—Caches ideally should have low miss rates and short access times, and should be power efficient at the same time. Such design goals are often contradictory in practice. Recent f...
179
click to vote
P2P
2008
IEEE
16 years 23 days ago
2008
IEEE
Peer-to-peer file-sharing networks depend on peers uploading data to each other. Some peers, called free-riders, will not upload data unless there is an incentive to do so. Algor...
141
click to vote
ICC
2007
IEEE
16 years 21 days ago
2007
IEEE
Abstract— A novel, simple and efficient method for the generation of Tikhonov (a.k.a. von Mises) random variates is proposed. In the proposed method, circular variates of a pres...
144
click to vote
LCN
2007
IEEE
16 years 19 days ago
2007
IEEE
Abstract—We study the performance of several search algorithms on unstructured peer-to-peer networks, both using classic search algorithms such as flooding and random walk, as w...