3874 search results - page 257 / 775 » Approximation Algorithms for k-hurdle Problems |
169
click to vote
IWLCS
2005
Springer
15 years 10 months ago
2005
Springer
Aiming to clarify the convergence or divergence conditions for Learning Classifier System (LCS), this paper explores: (1) an extreme condition where the reinforcement process of ...
150
click to vote
SENSYS
2003
ACM
15 years 9 months ago
2003
ACM
Sensor networks not only have the potential to change the way we use, interact with, and view computers, but also the way we use, interact with, and view the world around us. In o...
112
click to vote
CORR
2008
Springer
15 years 4 months ago
2008
Springer
Algorithmic pricing is the computational problem that sellers (e.g., in supermarkets) face when trying to set prices for their items to maximize their profit in the presence of a ...
152
click to vote
RCIS
2010
15 years 2 months ago
2010
—The strategies for mining frequent itemsets, which is the essential part of discovering association rules, have been widely studied over the last decade. In real-world datasets,...
109
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
We consider the problem of maximizing a nonnegative (possibly non-monotone) submodular set function with or without constraints. Feige et al. [9] showed a 2/5-approximation for th...