3875 search results - page 289 / 775 » Approximation algorithms for the 0-extension problem |
143
click to vote
CORR
2010
Springer
15 years 6 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...
188
click to vote
ATAL
2008
Springer
15 years 8 months ago
2008
Springer
Many multiagent domains where cooperation among agents is crucial to achieving a common goal can be modeled as coalitional games. However, in many of these domains, agents are une...
202
click to vote
FUIN
2006
15 years 6 months ago
2006
We consider approximate pattern matching in natural language text. We use the words of the text as the alphabet, instead of the characters as in traditional string matching approac...
180
click to vote
ICML
2002
IEEE
16 years 7 months ago
2002
IEEE
One of the central challenges in reinforcement learning is to balance the exploration/exploitation tradeoff while scaling up to large problems. Although model-based reinforcement ...
185
click to vote
SOFSEM
2007
Springer
16 years 26 days ago
2007
Springer
The problem of finding k minimum energy, edge-disjoint paths in wireless networks (MEEP) arises in the context of routing and belongs to the class of range assignment problems. A ...