First Page | Meta Content | |
---|---|---|
Document Date: 2010-05-28 11:06:43Open Document File Size: 139,11 KBShare Result on FacebookCityBaltimore / New York / Washington / DC / Sidney / Berlin / Santa Margherita Ligure / Amsterdam / Los Alamitos / London / /CompanyCNF / Demopoulos D. D. / Saks / ACM Press / Microsoft / /CountryItaly / United States / Australia / United Kingdom / Singapore / /FacilityThe Weizmann Institute / Hebrew University / /IndustryTermsearch strategies / local search algorithm / Local search heuristics / stable solution / polynomial-time algorithm / local search heuristic / hill climbing algorithm / Spectral refutation algorithms / empty product / potential applications / myopic algorithms / message passing algorithm / biological networks / message passing algorithms / recursive search / greedy algorithm / heuristic algorithms / greedy satisfiability algorithm / computing / search results / propagation-based algorithm / /OrganizationWeizmann Institute / Computer Science Department / Hebrew University / Jerusalem / p. / J. Assoc. / IEEE Computer Society / /PersonAbraham D. Flaxman / S. Khanna / /Positioncloning model for random graph. unpublished manuscript / /ProgrammingLanguageC / DC / /ProvinceOrStateMaryland / California / /PublishedMediumLecture Notes in Computer Science / /Technologylocal search algorithm / Myopic algorithms / H. An algorithm / hill climbing algorithm / Random Structures Algorithms / previous algorithms / message passing algorithms / Spectral refutation algorithms / message passing algorithm / J. Algorithms / cloning / machine learning / survey-propagation-based algorithm / cryptography / polynomial-time algorithm / DPLL algorithms / greedy satisfiability algorithm / greedy algorithm / related algorithm / /URLhttp /SocialTag |