4843 search results - page 224 / 969 » The Shortcut Problem - Complexity and Approximation |
124
click to vote
EDBT
2009
ACM
15 years 8 months ago
2009
ACM
The concept of time-constrained SQL queries was introduced to address the problem of long-running SQL queries. A key approach adopted for supporting time-constrained SQL queries i...
131
Voted
SIROCCO
2008
15 years 5 months ago
2008
We consider the problem of computing -approximate Nash equilibria in network congestion games. The general problem is known to be PLS-complete for every > 0, but the reductions...
128
Voted
EUROPAR
2010
Springer
15 years 3 months ago
2010
Springer
We present in this article a new approximation algorithm for scheduling a set of n independent rigid (meaning requiring a fixed number of processors) jobs on hierarchical parallel ...
150
Voted
INFOCOM
2010
IEEE
15 years 1 months ago
2010
IEEE
Abstract--We study the problem of maintaining group communication between m mobile agents, tracked and helped by n static networked sensors. We develop algorithms to maintain a O(l...
120
click to vote
ICAI
2009
15 years 1 months ago
2009
- We address the issues of improving the feature generation methods for the value-function approximation and the state space approximation. We focus the improvement of feature gene...