2446 search results - page 367 / 490 » Choiceless Polynomial Time |
WALCOM
2010
IEEE
13 years 6 months ago
2010
IEEE
Treewidth and pathwidth are important graph parameters that represent how close the graph is to trees and paths respectively. We calculate treewidth and pathwidth on parameterized ...
ANTSW
2010
Springer
13 years 5 months ago
2010
Springer
Ant colony optimization (ACO) has been widely used for different combinatorial optimization problems. In this paper, we investigate ACO algorithms with respect to their runtime beh...
COLT
2010
Springer
13 years 5 months ago
2010
Springer
A significant Fourier transform (SFT) algorithm, given a threshold and oracle access to a function f, outputs (the frequencies and approximate values of) all the -significant Fou...
FSTTCS
2010
Springer
13 years 5 months ago
2010
Springer
A fundamental problem in numerical computation and computational geometry is to determine the sign of arithmetic expressions in radicals. Here we consider the simpler problem of d...
GLOBECOM
2010
IEEE
13 years 5 months ago
2010
IEEE
Streaming erasure codes encode a source stream to guarantee that each source packet is recovered within a fixed delay at the receiver over a burst-erasure channel. This paper intro...