1298 search results - page 76 / 260 » The online set cover problem |
180
click to vote
DEDS
2008
15 years 6 months ago
2008
This paper deals with the on-line monitoring of large systems modeled as Petri Nets under partial observation. The plant observation is given by a subset of transitions whose occu...
161
click to vote
FOCS
2006
IEEE
16 years 13 days ago
2006
IEEE
In this work we study a wide range of online and offline routing and packing problems with various objectives. We provide a unified approach, based on a clean primal-dual method...
218
click to vote
SODA
2012
ACM
13 years 8 months ago
2012
ACM
Kernelization algorithms are polynomial-time reductions from a problem to itself that guarantee their output to have a size not exceeding some bound. For example, d-Set Matching f...
160
click to vote
CIAC
2010
Springer
16 years 3 months ago
2010
Springer
The problem of sharing the cost of a common infrastructure among a set of strategic and cooperating players has been the subject of intensive research in recent years. However, mos...
199
click to vote
SDM
2009
SIAM
16 years 3 months ago
2009
SIAM
Change-point detection is the problem of discovering time points at which properties of time-series data change. This covers a broad range of real-world problems and has been acti...