2899 search results - page 104 / 580 » On the Complexity of Exclusion Algorithms for Optimization |
226
click to vote
ICC
2011
IEEE
14 years 1 months ago
2011
IEEE
—Ant colony optimization (ACO) is a probabilistic technique used for solving complex computational problems, such as finding optimal routes in networks. It has been proved to pe...
131
click to vote
FOCS
2009
IEEE
15 years 8 months ago
2009
IEEE
Abstract— We consider the problem of estimating cascaded aggregates over a matrix presented as a sequence of updates in a data stream. A cascaded aggregate P ◦Q is defined by ...
115
click to vote
CIE
2007
Springer
15 years 7 months ago
2007
Springer
In the framework of parameterized complexity, exploring how one parameter affects the complexity of a different parameterized (or unparameterized problem) is of general interest....
140
click to vote
FUN
2010
Springer
15 years 6 months ago
2010
Springer
Abstract. We analyze the computational complexity of various twodimensional platform games. We identify common properties of these games that allow us to state several meta-theorem...
109
click to vote
ICC
2007
IEEE
15 years 7 months ago
2007
IEEE
—New air interfaces are currently being developed to meet the high spectral efficiency requirements of the emerging wireless communication systems. In this context, OFDM is cons...