2569 search results - page 374 / 514 » Approximate Objects and Approximate Theories |
154
click to vote
INFOCOM
2009
IEEE
16 years 1 months ago
2009
IEEE
—Sensor network localization is an instance of the NP-HARD graph realization problem. Thus, methods used in practice are not guaranteed to find the correct localization, even if...
139
click to vote
ATAL
2009
Springer
16 years 1 months ago
2009
Springer
Reinforcement learning algorithms that use eligibility traces, such as Sarsa(λ), have been empirically shown to be effective in learning good estimated-state-based policies in pa...
170
click to vote
ATAL
2009
Springer
16 years 1 months ago
2009
Springer
Decentralized partially observable Markov decision processes (Dec-POMDPs) constitute a generic and expressive framework for multiagent planning under uncertainty. However, plannin...
163
click to vote
CIKM
2009
Springer
16 years 1 months ago
2009
Springer
Score normalization is indispensable in distributed retrieval and fusion or meta-search where merging of result-lists is required. Distributional approaches to score normalization...
168
click to vote
CIKM
2009
Springer
16 years 1 months ago
2009
Springer
We consider the problem of releasing a limited public view of a sensitive graph which reveals at least k edges per node. We are motivated by Facebook’s public search listings, w...