3367 search results - page 467 / 674 » Incremental assignment problem |
126
click to vote
MSN
2007
Springer
15 years 10 months ago
2007
Springer
The access scheduling on the control channels in TDMA wireless mesh networks is studied in this paper. The problem is to assign time-slots for each node in the network to access th...
128
click to vote
SLS
2007
Springer
15 years 10 months ago
2007
Springer
Stochastic Local Search (SLS) is quite effective for a variety of Combinatorial (Optimization) Problems (COP). However, the performance of SLS depends on several factors and getti...
130
click to vote
WDAG
2007
Springer
15 years 10 months ago
2007
Springer
We consider the problem of minimizing the number of ADMs in optical networks. All previous theoretical studies of this problem dealt with the off-line case, where all the lightpat...
106
Voted
GLOBECOM
2006
IEEE
15 years 10 months ago
2006
IEEE
— We study the problem of building an optimal network-layer clustering hierarchy, where the optimality can be defined using three potentially conflicting metrics: state, delay ...
101
click to vote
ICRA
2006
IEEE
15 years 10 months ago
2006
IEEE
— As mobile robots become increasingly autonomous over extended periods of time, opportunities arise for their use on repetitive tasks. We define and implement behaviors for a c...