To converge more quickly and effectively -- mean field annealing based optimal path selection in WMN (Q526678): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Neural networks and physical systems with emergent collective computational abilities. / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Algorithms for finding paths with multiple constraints / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q2743942 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: QoS routing in wireless sensor networks—a survey / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Bidirectional Multi-Constrained Routing Algorithms / rank | |||
Normal rank | |||
Revision as of 19:09, 13 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | To converge more quickly and effectively -- mean field annealing based optimal path selection in WMN |
scientific article |
Statements
To converge more quickly and effectively -- mean field annealing based optimal path selection in WMN (English)
0 references
15 May 2017
0 references
energy function
0 references
multi-constrained path selection with optimization
0 references
mean field annealing
0 references
simulated annealing
0 references
