3875 search results - page 315 / 775 » Approximation algorithms for the 0-extension problem |
205
click to vote
INFOCOM
2012
IEEE
13 years 9 months ago
2012
IEEE
—In this paper, we tackle the spectrum allocation problem in cognitive radio (CR) networks with time-frequency flexibility consideration using combinatorial auction. Different f...
192
click to vote
VLDB
2004
ACM
16 years 4 days ago
2004
ACM
Data Cleaning is an important process that has been at the center of research interest in recent years. An important end goal of effective data cleaning is to identify the relatio...
202
click to vote
CORR
2006
Springer
15 years 6 months ago
2006
Springer
Suppose we are given a set of objects that cover a region and a duration associated with each object. Viewing the objects as jobs, can we schedule their beginning times to maximiz...
217
click to vote
GECCO
2005
Springer
16 years 9 days ago
2005
Springer
Many real-world problems are multi-objective optimization problems and evolutionary algorithms are quite successful on such problems. Since the task is to compute or approximate t...
166
click to vote
SECON
2010
IEEE
15 years 4 months ago
2010
IEEE
In this paper, we address several problems that arise in the context of rotating directional sensors. Rotating directional sensors (RDS) have a "directional" coverage reg...