An approximate dynamic programming approach for improving accuracy of lossy data compression by Bloom filters-Reference-Cited by-同舟云学术

An approximate dynamic programming approach for improving accuracy of lossy data compression by Bloom filters

Published:2016-08 Issue:3 Volume:252 Page:985-994
ISSN:0377-2217
Container-title:European Journal of Operational Research
language:en
Short-container-title:European Journal of Operational Research

Author:

Yang Xinan,Vernitski Alexei,Carrea Laura

Publisher

Elsevier BV

Subject

Information Systems and Management,Management Science and Operations Research,Modeling and Simulation,General Computer Science,Industrial and Manufacturing Engineering

Reference33 articles.

1. Dynamic programming and optimal control: Approximate dynamic programming;Bertsekas,2012

2. An approximate dynamic programming approach to multidimensional knapsack problems;Bertsimas;Management Science,2002

3. Space/time trade-offs in hash coding with allowable errors;Bloom;Communications of the ACM,1970

4. Network applications of bloom filters: A survey;Broder;Internet Mathematics,2002

5. Weighted bloom filters;Bruck,2006

Cited by 11 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. İkili Bal Porsuğu Algoritmasının Küme Birleşimli Sırt Çantası Problemine Uygulanması;Düzce Üniversitesi Bilim ve Teknoloji Dergisi;2024-04-29

2. Variable Neighborhood Search with Dynamic Exploration for the Set Union Knapsack Problem;International Series in Operations Research & Management Science;2024

3. Exploring Initialization Strategies for Metaheuristic Optimization: Case Study of the Set-Union Knapsack Problem;Mathematics;2023-06-14

4. Encoding the Shortest Paths in a King's Graph;Fundamental Journal of Mathematics and Applications;2022-10-14

5. The Knapsack Problem and Its Variants: Formulations and Solution Methods;The Palgrave Handbook of Operations Research;2022