کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
379117 | 659265 | 2008 | 19 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
On space constrained set selection problems
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
هوش مصنوعی
پیش نمایش صفحه اول مقاله

چکیده انگلیسی
Space constrained optimization problems arise in a variety of applications, ranging from databases to ubiquitous computing. Typically, these problems involve selecting a set of items of interest, subject to a space constraint.We show that in many important applications, one faces variants of this basic problem, in which the individual items are sets themselves, and each set is associated with a benefit value. Since there are no known approximation algorithms for these problems, we explore the use of greedy and randomized techniques. We present a detailed performance and theoretical evaluation of the algorithms, highlighting the efficiency of the proposed solutions.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Data & Knowledge Engineering - Volume 67, Issue 1, October 2008, Pages 200–218
Journal: Data & Knowledge Engineering - Volume 67, Issue 1, October 2008, Pages 200–218
نویسندگان
Themis Palpanas, Nick Koudas, Alberto Mendelzon,