5114 search results - page 321 / 1023 » Complex networks |
139
click to vote
AI
2007
Springer
15 years 10 months ago
2007
Springer
DEC-POMDPs provide formal models of many cooperative multiagent problems, but their complexity is NEXP-complete in general. We investigate a sub-class of DEC-POMDPs termed multiage...
105
click to vote
EVOW
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. We demonstrate how a genetic algorithm solves the problem of minimizing the resources used for network coding, subject to a throughput constraint, in a multicast scenario...
170
click to vote
GPC
2007
Springer
15 years 10 months ago
2007
Springer
Heterogeneous wireless sensor network (heterogeneous WSN) consists of sensor nodes with different ability, such as different computing power and sensing range. Compared with homoge...
130
click to vote
SOFSEM
2007
Springer
15 years 10 months ago
2007
Springer
The problem of finding k minimum energy, edge-disjoint paths in wireless networks (MEEP) arises in the context of routing and belongs to the class of range assignment problems. A ...
118
click to vote
TRIDENTCOM
2006
IEEE
15 years 9 months ago
2006
IEEE
This paper describes the motivation, methodology and implementation approach of the testbed that has been developed in the framework of the EVEREST project. Such testbed is used f...