10988 search results - page 370 / 2198 » Algorithmic Folding Complexity |
156
click to vote
TWC
2008
15 years 4 months ago
2008
In this paper, designing an effective user relaying algorithm, in terms of relay node selection and power allocation, is discussed for amplify-and-forward wireless relay networks. ...
174
click to vote
ATAL
2008
Springer
15 years 7 months ago
2008
Springer
Complete algorithms have been proposed to solve problems modelled as distributed constraint optimization (DCOP). However, there are only few attempts to address real world scenari...
147
click to vote
ATAL
2008
Springer
15 years 7 months ago
2008
Springer
Due to computational intractability, large scale coordination algorithms are necessarily heuristic and hence require tuning for particular environments. In domains where character...
156
click to vote
ATAL
2008
Springer
15 years 7 months ago
2008
Springer
Mixed multi-unit combinatorial auctions are combinatorial auctions in which the auctioneer and the bidders negotiate over transformations rather than over simple goods. By proposi...
137
click to vote
APCCAS
2006
IEEE
15 years 6 months ago
2006
IEEE
- In this paper, the grouped scheme is specially applied to compute the fast Fourier transform (FFT) when the portions of transformed outputs are calculated selectively. The groupe...