完整後設資料紀錄
DC 欄位語言
dc.contributor.authorDin, DRen_US
dc.contributor.authorTseng, SSen_US
dc.contributor.authorJiang, MFen_US
dc.date.accessioned2014-12-08T15:45:55Z-
dc.date.available2014-12-08T15:45:55Z-
dc.date.issued2000en_US
dc.identifier.isbn3-540-41428-2en_US
dc.identifier.issn0302-9743en_US
dc.identifier.urihttp://hdl.handle.net/11536/30884-
dc.description.abstractIn this paper, we investigate the extended cell assignment problem which optimally assigns new and split cells in PCS (Personal Communication Service) to switches in a wireless ATM network. Given cells and switches in an ATM network (whose locations are fixed and known), the problem is assigning cells to switches in an optimum manner. We would like to do the assignment in as attempt to minimize a cost criterion. The cost has two components: one is the cost of handoffs that involve two switches, and the other is the cost of cabling. This problem is modeled as a complex integer programming problem and finding an optimal solution to this problem is NP-complete. A stochastic search method, based on a genetic approach is proposed to solve this problem. Simulation results show that genetic algorithm is robust for this problem.en_US
dc.language.isoen_USen_US
dc.subjectwireless ATMen_US
dc.subjectgenetic algorithmsen_US
dc.subjectdesign of algorithmen_US
dc.subjectassignment problemen_US
dc.titleGenetic algorithm for extended cell assignment problem in wireless ATM networken_US
dc.typeArticle; Proceedings Paperen_US
dc.identifier.journalADVANCES IN COMPUTING SCIENCE-ASIAN 2000, PROCEEDINGSen_US
dc.citation.volume1961en_US
dc.citation.spage69en_US
dc.citation.epage87en_US
dc.contributor.department資訊工程學系zh_TW
dc.contributor.departmentDepartment of Computer Scienceen_US
dc.identifier.wosnumberWOS:000171236800007-
顯示於類別:會議論文