Proposal of a sub-λ switching network and its time-slot assignment algorithm for network with asynchronous time-slot phase.
Keisuke OkamotoAtsushi HiramatsuPublished in: Kaleidoscope (2013)
Keyphrases
- communication networks
- dynamic programming
- k means
- clustering algorithm
- wireless sensor networks
- optimization algorithm
- detection algorithm
- computational complexity
- learning phase
- peer to peer
- fully connected
- network parameters
- expectation maximization
- network model
- growing neural gas
- worst case
- computational cost
- learning algorithm
- preprocessing phase
- shortest path algorithm
- path length
- network flow
- training phase
- computer networks
- network traffic
- times faster
- segmentation algorithm
- np hard