1298 search results - page 79 / 260 » The online set cover problem |
160
click to vote
ETFA
2008
IEEE
16 years 26 days ago
2008
IEEE
1 In this paper, we study the problem of scheduling a set of control tasks. We distinguish three different situations of states of controlled plants: not activated, steady state si...
152
click to vote
CRIWG
2008
15 years 7 months ago
2008
This paper presents an analysis tool for comparative and collaborative evaluation of mobile artefact usage. Three scenarios were envisioned for the comparative dimension covering b...
149
click to vote
DAGSTUHL
2006
15 years 7 months ago
2006
We study the online version of the classical parallel machine scheduling problem to minimize the total weighted completion time from a new perspective: We assume that the data of ...
156
click to vote
COLT
2008
Springer
15 years 8 months ago
2008
Springer
We study on-line decision problems where the set of actions that are available to the decision algorithm vary over time. With a few notable exceptions, such problems remained larg...
168
click to vote
IPL
2007
15 years 6 months ago
2007
The online frequency allocation problem for cellular networks has been well studied in these years. Given a mobile telephone network, whose geographical coverage area is divided i...