View Document Preview and Link Document Date: 2010-03-18 09:58:54 Open Document File Size: 405,40 KB Share Result on Facebook
City Palo Alto / New York / New York City / Kozani / Mountain View / / Company IBM / Hewlett-Packard Laboratories / Microsoft / / Country Macedonia / Greece / / Currency pence / / / Event Product Issues / Product Recall / / Facility Princeton University / University of Western Macedonia / / IndustryTerm benchmark algorithm / basic algorithms / road networks / simplest solution / parametric algorithm / event systems / study algorithms / mainstream hardware / hybrid algorithms / search algorithm / binary search algorithm / above network / non-optimal solution / feasibility-based algorithms / binary search / bility algorithm / pass algorithm / depth-first search / hybrid algorithm / benchmark algorithms / pass algorithms / / OperatingSystem Windows Server 2003 / / Organization National Science Foundation / Princeton University / Informatics and Telecommunications Engineering Department / federal government / Department of Computer Science / / Person Andrew V / Stephan Held / Ali Dasdan / / / Position forward / / Product Cycle / / ProgrammingLanguage Visual C++ / C++ / / ProvinceOrState New Jersey / Florida / California / / Region Western Macedonia / / Technology two possible 5 Incremental Restarts SPF algorithms / 6.1 Cycle-based algorithm / feasibility-based algorithms / SPF-based algorithms / 1.1 Algorithms / Cycle algorithm / search algorithm / 3.1 SPF-based Algorithms / SPF algorithms / binary search algorithm / generic Cycle algorithm / studies Abstract We study algorithms / 6.2 Tree-based algorithm / parametric algorithm / pass algorithm / pass algorithms / relevant benchmark algorithm / hybrid algorithm / bility algorithm / SPF algorithm / benchmark algorithms / tree-based algorithm / four basic algorithms / Tree algorithm / cycle-based algorithm / four algorithms / 2.2 SPF Algorithms / / SocialTag 
An Experimental Study of Minimum Mean Cycle Algorithms Loukas Georgiadis1