Sciweavers

2520 search results - page 339 / 504
» The complexity of approximating entropy
Sort
View
VTC
2007
IEEE
128views Communications» more  VTC 2007»
15 years 11 months ago
Performance of Space-Code-Division Multiple-Access Systems Using Reduced-Rank Detection
Abstract—In this contribution the performance of multipleinput multiple-output space-division, code-division multipleaccess (MIMO SCDMA) is investigated, when the low-complexity ...
Jiliang Zhang, Lie-Liang Yang
ATAL
2007
Springer
15 years 11 months ago
Distributed task allocation in social networks
This paper proposes a new variant of the task allocation problem, where the agents are connected in a social network and tasks arrive at the agents distributed over the network. W...
Mathijs de Weerdt, Yingqian Zhang, Tomas Klos
149
Voted
CPAIOR
2007
Springer
15 years 11 months ago
Connections in Networks: Hardness of Feasibility Versus Optimality
We study the complexity of combinatorial problems that consist of competing infeasibility and optimization components. In particular, we investigate the complexity of the connectio...
Jon Conrad, Carla P. Gomes, Willem Jan van Hoeve, ...
ECML
2007
Springer
15 years 11 months ago
Learning Balls of Strings with Correction Queries
When facing the question of learning languages in realistic settings, one has to tackle several problems that do not admit simple solutions. On the one hand, languages are usually...
Leonor Becerra-Bonache, Colin de la Higuera, Jean-...
EUROCAST
2007
Springer
126views Hardware» more  EUROCAST 2007»
15 years 11 months ago
Determining Orbital Elements of Extrasolar Planets by Evolution Strategies
After the detection of the first extrasolar planet (exoplanet) more than one decade ago we currently know about more than 200 planets around other stars and there are about twenty...
Andreas M. Chwatal, Günther R. Raidl