Sciweavers

3875 search results - page 253 / 775
» Approximation algorithms for the 0-extension problem
Sort
View
EC
2000
187views ECommerce» more  EC 2000»
15 years 6 months ago
Comparison of Multiobjective Evolutionary Algorithms: Empirical Results
In this paper, we provide a systematic comparison of various evolutionary approaches to multiobjective optimization using six carefully chosen test functions. Each test function i...
Eckart Zitzler, Kalyanmoy Deb, Lothar Thiele
ICASSP
2011
IEEE
14 years 10 months ago
Robust secondary multicast transmit beamforming for cognitive radio networks under imperfect channel state information
Consider a robust downlink beamforming optimization problem for secondary multicast transmission in a multiple-input multiple-output (MIMO) spectrum sharing cognitive radio (CR) n...
Yongwei Huang, Qiang Li, Wing-Kin Ma, Shuzhong Zha...
IS
2008
15 years 6 months ago
The complexity and approximation of fixing numerical attributes in databases under integrity constraints
Consistent query answering is the problem of characterizing and computing the semantically correct answers to queries from a database that may not satisfy certain integrity constr...
Leopoldo E. Bertossi, Loreto Bravo, Enrico Francon...
ESA
2007
Springer
115views Algorithms» more  ESA 2007»
16 years 26 days ago
Approximation of Partial Capacitated Vertex Cover
We study the partial capacitated vertex cover problem (pcvc) in which the input consists of a graph G and a covering requirement L. Each edge e in G is associated with a demand (o...
Reuven Bar-Yehuda, Guy Flysher, Julián Mest...
ALGOSENSORS
2008
Springer
15 years 8 months ago
Target Counting under Minimal Sensing: Complexity and Approximations
We consider the problem of counting a set of discrete point targets using a network of sensors under a minimalistic model. Each sensor outputs a single integer, the number of disti...
Sorabh Gandhi, Rajesh Kumar 0003, Subhash Suri