2766 search results - page 146 / 554 » Algorithms for trigonometric polynomials |
133
click to vote
CDC
2008
IEEE
15 years 10 months ago
2008
IEEE
— We come up with novel quantized averaging algorithms on synchronous and asynchronous communication networks with fixed, switching and random topologies. The implementation of ...
149
click to vote
WADS
2005
Springer
15 years 9 months ago
2005
Springer
We consider an APX-hard variant (∆-Max-ATSP) and an APX-hard relaxation (Max-3-DCC) of the classical traveling salesman problem. We present a 31 40-approximation algorithm for ...
114
click to vote
CL
2000
Springer
15 years 8 months ago
2000
Springer
We introduce an algorithm for cooperative planning in multi-agent systems. The algorithm enables the agents to combine (fuse) their plans in order to increase their joint profits...
123
click to vote
DAM
2010
15 years 4 months ago
2010
In this paper we propose a new integer programming formulation for the multilevel facility location problem and a novel 3-approximation algorithm based on LP rounding. The linear ...
146
click to vote
AAECC
2006
Springer
15 years 4 months ago
2006
Springer
We propose a slight modification of the Berlekamp-Massey Algorithm for obtaining the minimal polynomial of a given linearly recurrent sequence. Such a modification enables to expl...