1298 search results - page 212 / 260 » The online set cover problem |
103
click to vote
ATAL
2006
Springer
14 years 11 months ago
2006
Springer
Bidding for multiple items or bundles on online auctions raises challenging problems. We assume that an agent has a valuation function that returns its valuation for an arbitrary ...
KDD
2010
ACM
14 years 11 months ago
2010
ACM
Influence maximization, defined by Kempe, Kleinberg, and Tardos (2003), is the problem of finding a small set of seed nodes in a social network that maximizes the spread of influe...
TNN
2008
14 years 9 months ago
2008
This brief presents an efficient and scalable online learning algorithm for recurrent neural networks (RNNs). The approach is based on the real-time recurrent learning (RTRL) algor...
CJ
2004
14 years 9 months ago
2004
This paper describes a way to manage the modeling and analysis of Scheduled Maintenance Systems (SMS) within an analytically tractable context. We chose a significant case study h...
TASLP
2002
14 years 9 months ago
2002
This paper applies time-varying autoregressive (TVAR) models with stochastically evolving parameters to the problem of speech modeling and enhancement. The stochastic evolution mod...