1298 search results - page 125 / 260 » The online set cover problem |
160
click to vote
WWW
2007
ACM
16 years 7 months ago
2007
ACM
Previous studies have highlighted the high arrival rate of new content on the web. We study the extent to which this new content can be efficiently discovered by a crawler. Our st...
161
click to vote
CPAIOR
2005
Springer
16 years 22 hour ago
2005
Springer
The Employee Timetabling Problem (ETP) is a general class of problems widely encountered in service organizations (such as call centers for instance). Given a set of activities, a ...
216
click to vote
STOC
2010
ACM
15 years 10 months ago
2010
ACM
Consider the following two-player communication process to decide a language L: The first player holds the entire input x but is polynomially bounded; the second player is computa...
166
click to vote
ILP
2003
Springer
15 years 11 months ago
2003
Springer
In the case of concept learning from positive and negative examples, it is rarely possible to find a unique discriminating conjunctive rule; in most cases, a disjunctive descripti...
184
click to vote
ICML
2008
IEEE
16 years 7 months ago
2008
IEEE
In many retrieval tasks, one important goal involves retrieving a diverse set of results (e.g., documents covering a wide range of topics for a search query). First of all, this r...