1554 search results - page 178 / 311 » Parameterized Complexity and Approximation Algorithms |
115
click to vote
AAAI
2007
15 years 5 months ago
2007
Developing scalable coordination algorithms for multi-agent systems is a hard computational challenge. One useful approach, demonstrated by the Coverage Set Algorithm (CSA), explo...
152
click to vote
COCO
1993
Springer
15 years 7 months ago
1993
Springer
We introduce a linear algebraic model of computation, the Span Program, and prove several upper and lower bounds on it. These results yield the following applications in complexit...
154
click to vote
ESA
2000
Springer
15 years 7 months ago
2000
Springer
We consider the problem of preemptively scheduling a set of n jobs on m (identical, uniformly related, or unrelated) parallel machines. The scheduler may reject a subset of the job...
126
Voted
DICTA
2003
15 years 4 months ago
2003
In this paper we review a number of approaches to reducing, or removing, the problem of shift variance in the discrete wavelet transform (DWT). We describe a generalization of the ...
154
click to vote
STOC
2009
ACM
16 years 3 months ago
2009
ACM
Submodular function maximization is a central problem in combinatorial optimization, generalizing many important problems including Max Cut in directed/undirected graphs and in hy...