1298 search results - page 144 / 260 » The online set cover problem |
227
click to vote
APPROX
2005
Springer
16 years 2 days ago
2005
Springer
The field of stochastic optimization studies decision making under uncertainty, when only probabilistic information about the future is available. Finding approximate solutions to...
177
click to vote
ATAL
2008
Springer
15 years 8 months ago
2008
Springer
We consider Coalitional Skill Games (CSGs), a simple model of cooperation among agents. This is a restricted form of coalitional games, where each agent has a set of skills that a...
175
click to vote
KDD
2007
ACM
16 years 7 months ago
2007
ACM
Previous work on text mining has almost exclusively focused on a single stream. However, we often have available multiple text streams indexed by the same set of time points (call...
222
click to vote
JMLR
2008
15 years 6 months ago
2008
Log-linear and maximum-margin models are two commonly-used methods in supervised machine learning, and are frequently used in structured prediction problems. Efficient learning of...
200
click to vote
ICCCN
2008
IEEE
16 years 29 days ago
2008
IEEE
—We investigate the p-percent coverage problem in this paper and propose two algorithms to prolong network lifetime based on the fact that for some applications full coverage is ...