1930 search results - page 2 / 386 » A Dynamic Graph Algorithm for the Highly Dynamic Network Pro... |
IJMC
2006
13 years 5 months ago
2006
: The Channel Assignment Problem is an NP-complete problem to assign a minimum number of channels under certain constraints to requested calls in a cellular radio system. Examples ...
ATAL
2008
Springer
13 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...
ANTSW
2010
Springer
13 years 9 days ago
2010
Springer
Abstract. We consider the problem of finding and maintaining communication paths in wireless mobile ad hoc networks (MANET). We consider this problem as a bi-objective problem when...
NCA
2007
IEEE
13 years 11 months ago
2007
IEEE
The assessment of routing protocols for wireless networks is a difficult task, because of the networks’ highly dynamic behavior and the absence of benchmarks. However, some of ...
IJCNN
2007
IEEE
13 years 11 months ago
2007
IEEE
— The assessment of highly-risky situations at road intersections have been recently revealed as an important research topic within the context of the automotive industry. In thi...