1298 search results - page 197 / 260 » The online set cover problem |
183
click to vote
ATAL
2007
Springer
16 years 1 months ago
2007
Springer
In this paper we consider the problem of managing and exploiting schedules in an uncertain and distributed environment. We assume a team of collaborative agents, each responsible ...
288
click to vote
ICDE
2008
IEEE
16 years 8 months ago
2008
IEEE
Many applications require finding objects closest to a specified location that contains a set of keywords. For example, online yellow pages allow users to specify an address and a ...
211
click to vote
IPSN
2010
Springer
16 years 1 months ago
2010
Springer
This paper develops algorithms to train linear support vector machines (SVMs) when training data are distributed across different nodes and their communication to a centralized no...
177
click to vote
DFT
2003
IEEE
16 years 4 days ago
2003
IEEE
1 This paper presents a solution to the test time minimization problem for core-based systems that contain sequential cores with STUMPS architecture. We assume a hybrid BIST approa...
193
click to vote
ADC
2003
Springer
16 years 3 days ago
2003
Springer
This paper proposes a novel way of automatically developing data warehouse configuration in rule-based CRM systems. Rule-based CRM systems assume that marketing activities are re...