5624 search results - page 148 / 1125 » On Conditional Covering Problem |
160
click to vote
STOC
2006
ACM
16 years 6 months ago
2006
ACM
Many approximation algorithms have been presented in the last decades for hard search problems. The focus of this paper is on cryptographic applications, where it is desired to de...
190
click to vote
WALCOM
2007
IEEE
15 years 7 months ago
2007
IEEE
Due to the recent growth in the demand of mobile communication services in several typical environments, the development of efficient systems for providing specialized services ha...
174
click to vote
EVOW
2007
Springer
15 years 10 months ago
2007
Springer
RND (Radio Network Design) is a Telecommunication problem consisting in covering a certain geographical area by using the smallest number of radio antennas achieving the biggest co...
157
click to vote
CORR
2006
Springer
15 years 6 months ago
2006
Springer
In multi-criteria optimization, several objective functions are to be optimized. Since the different objective functions are usually in conflict with each other, one cannot conside...
175
click to vote
COMPGEOM
2009
ACM
16 years 27 days ago
2009
ACM
We consider the following combinatorial problem: given a set of n objects (for example, disks in the plane, triangles), and an integer L ≥ 1, what is the size of the smallest su...