Thumbnail
Access Restriction
Subscribed

Author Wakamiya, Naoki ♦ Murata, Masayuki ♦ Leibnitz, Kenji
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Language English
Abstract Using randomness to find optimal solutions in selecting network paths.
Description Affiliation: Osaka University, Japan (Leibnitz, Kenji; Wakamiya, Naoki; Murata, Masayuki)
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 2005-08-01
Publisher Place New York
Journal Communications of the ACM (CACM)
Volume Number 49
Issue Number 3
Page Count 6
Starting Page 62
Ending Page 67


Open content in new tab

   Open content in new tab
Source: ACM Digital Library