copyright c00185

copyright c00185

ID:34577584

大小:327.12 KB

页数:33页

时间:2019-03-08

copyright c00185_第1页
copyright c00185_第2页
copyright c00185_第3页
copyright c00185_第4页
copyright c00185_第5页
资源描述:

《copyright c00185》由会员上传分享,免费在线阅读,更多相关内容在教育资源-天天文库

1、BRICSBasicResearchinComputerScienceBRICSRS-00-21Moller&Alur:HeuristicsforHierarchicalPartitioning¨HeuristicsforHierarchicalPartitioningwithApplicationtoModelCheckingM.OliverMoller¨RajeevAlurBRICSReportSeriesRS-00-21ISSN0909-0878August2000Copyrightc2000,M.OliverMolle

2、r&RajeevAlur.¨BRICS,DepartmentofComputerScienceUniversityofAarhus.Allrightsreserved.Reproductionofallorpartofthisworkispermittedforeducationalorresearchuseonconditionthatthiscopyrightnoticeisincludedinanycopy.SeebackinnerpageforalistofrecentBRICSReportSeriespublicat

3、ions.Copiesmaybeobtainedbycontacting:BRICSDepartmentofComputerScienceUniversityofAarhusNyMunkegade,building540DK–8000AarhusCDenmarkTelephone:+4589423360Telefax:+4589423255Internet:BRICS@brics.dkBRICSpublicationsareingeneralaccessiblethroughtheWorldWideWebandanonymou

4、sFTPthroughtheseURLs:http://www.brics.dkftp://ftp.brics.dkThisdocumentinsubdirectoryRS/00/21/HeuristicsforHierarchicalPartitioningwithApplicationtoModelCheckingM.OliverM¨oller†andRajeevAlur‡†BRICS‡UniversityofPennsylvaniaDepartmentofComputerScienceComputer&Informati

5、onScienceUniversityofAarhusMoorebuildingNyMunkegade,building540200South33rdStreetDK-8000˚ArhusC,DenmarkPhiladelphia,PA19104,USAomoeller@brics.dkalur@cis.upenn.edu30August2000AbstractGivenacollectionofconnectedcomponents,itisoftendesiredtoclustertogetherpartsofstrong

6、correspondence,yieldingahierarchicalstructure.Weaddresstheau-tomationofthisprocessandapplyheuristicstobattlethecombinatorialandcompu-tationalcomplexity.Wedefineacostfunctionthatcapturesthequalityofastructurerelativetotheconnectionsandfavorsshallowstructureswithalowde

7、greeofbranching.FindingastructurewithminimalcostisshowntobeNP-complete.Wepresentagreedypolynomial-timealgorithmthatcreatesanapproximativegoodsolutionincrementallybylocalevaluationofaheuristicfunction.Wecomparesomesimpleheuristicfunc-tionsandargueforonebasedonfourcri

8、teria:Thenumberofenclosedconnections,thenumberofcomponents,thenumberoftouchedconnectionsandthedepthofthestructure.Wereportonanapplicationi

当前文档最多预览五页,下载文档查看全文

此文档下载收益归作者所有

当前文档最多预览五页,下载文档查看全文
温馨提示:
1. 部分包含数学公式或PPT动画的文件,查看预览时可能会显示错乱或异常,文件下载后无此问题,请放心下载。
2. 本文档由用户上传,版权归属用户,天天文库负责整理代发布。如果您对本文档版权有争议请及时联系客服。
3. 下载前请仔细阅读文档内容,确认文档内容符合您的需求后进行下载,若出现内容与标题不符可向本站投诉处理。
4. 下载文档时可能由于网络波动等原因无法下载或下载错误,付费完成后未能成功下载的用户请联系客服处理。