74 search results - page 8 / 15 » The Complexity of Black-Box Ring Problems |
SIROCCO
2010
13 years 6 months ago
2010
We consider the problem of exploring an anonymous unoriented ring of size n by k identical, oblivious, asynchronous mobile robots, that are unable to communicate, yet have the abil...
INFOCOM
2000
IEEE
14 years 9 days ago
2000
IEEE
— We study wavelength assignment for lightpaths over WDM rings to minimize the SONET ADMs used. This problem has attracted much attention recently. However, its computation compl...
TEC
2010
13 years 2 months ago
2010
Niching is an important technique for multimodal optimization. Most existing niching methods require specification of certain niching parameters in order to perform well. These nic...
CLUSTER
2000
IEEE
13 years 7 months ago
2000
IEEE
Ring networks are enjoying renewed interest as Storage Area Networks (SANs), i.e., networks for interconnecting storage devices (e.g., disk, disk arrays and tape drives) and stora...
PAIRING
2007
Springer
14 years 2 months ago
2007
Springer
— In EUROCRYPT 2006, Cheon proposed breakthrough algorithms for pairing-related problems such as the q-weak/strong Diffie-Hellman problem. Using that the exponents of an element ...