480 search results - page 40 / 96 » Approximate and exact algorithms for the fixed-charge knapsa... |
ICALP
2005
Springer
14 years 2 months ago
2005
Springer
Virtual Private Network Design is the following NP-hard problem. We are given a communication network, represented as a weighted graph with thresholds on the nodes which represent...
CPM
2008
Springer
13 years 11 months ago
2008
Springer
We introduce a new dimension to the widely studied on-line approximate string matching problem, by introducing an error threshold parameter so that the algorithm is allowed to mis...
SIGMOD
2003
ACM
14 years 9 months ago
2003
ACM
We consider the problem of approximating sliding window joins over data streams in a data stream processing system with limited resources. In our model, we deal with resource cons...
ACST
2006
13 years 10 months ago
2006
A constraint satisfaction problem (CSP) is a general framework that can formalize various application problems in artificial intelligence. However, practical real-world problems t...
IJCAI
2003
13 years 10 months ago
2003
This paper introduces the Point-Based Value Iteration (PBVI) algorithm for POMDP planning. PBVI approximates an exact value iteration solution by selecting a small set of represen...