2412 search results - page 133 / 483 » Which Problems Have Strongly Exponential Complexity |
133
click to vote
ISCAS
2008
IEEE
15 years 9 months ago
2008
IEEE
— Since the complexity of MIMO detection algorithms is exponential, the K–best algorithm is often chosen for efficient VLSI implementation. This detection problem is often view...
133
Voted
CD
2005
Springer
15 years 9 months ago
2005
Springer
In distributed and mobile environments, the connections among the hosts on which a software system is running are often unstable. As a result of connectivity losses, the overall av...
130
click to vote
ASIACRYPT
2000
Springer
15 years 7 months ago
2000
Springer
Abstract. Construction of secure hyperelliptic curves is of most important yet most difficult problem in design of cryptosystems based on the discrete logarithm problems on hyperel...
142
click to vote
ATAL
2004
Springer
15 years 7 months ago
2004
Springer
The coalition formation process, in which a number of independent, autonomous agents come together to act as a collective, is an important form of interaction in multiagent system...
134
Voted
PIMRC
2010
IEEE
15 years 1 months ago
2010
IEEE
This study addresses the general problem of efficient resource management in wireless networks with arbitrary timevarying topologies. Communication channels are assumed to generall...