02904nam 22006254a 450 991078503180332120230620165718.01-282-66334-8978661266334590-272-8768-6(CKB)2670000000034052(SSID)ssj0000418596(PQKBManifestationID)11261467(PQKBTitleCode)TC0000418596(PQKBWorkID)10370828(PQKB)11310145(MiAaPQ)EBC622608(Au-PeEL)EBL622608(CaPaEBR)ebr10402751(CaONFJC)MIL266334(OCoLC)655829563(EXLCZ)99267000000003405220081217h20092009 uy 0engurcn|||||||||txtrdacontentcrdamediacrrdacarrierGermanic languages and linguistic universals /editors, John Ole Askedal, Ian Roberts, Tomonori Matsushita, Hiroshi HasegawaAmsterdam ;Philadelphia :John Benjamins Pub. Company,2009.©20091 online resource (212 pages) illustrationsThe development of the Anglo-Saxon language and linguistic universals,1877-3451 ;v. 1Bibliographic Level Mode of Issuance: Monograph90-272-1068-3 Includes bibliographical references and index.Some general evolutionary and typological characteristics of the Germanic languages / John Ole Askedal -- Characteristics of Germanic languages / Tadao Shimomiya -- Old English pronouns for possession / Yasuaki Fujiwara -- Reflexive binding as agreement and its locality conditions within the phase system / Hiroshi Hasegawa -- Movement in the passive nominal : a morphological analysis / Junji Hamamatsu -- On tritransitive verbs / Ryohei Mita -- On the cognitive dependence phenomena observed in English expressions / Shuichi Takeda -- On pronoun referents in English / Hiromi Azuma -- Relative and interrogative who/whom in contemporary professional American English / Yoko Iyeiri and Michiko Yaguchi -- New functions of FrameSQL for multilingual FrameNets / Hiroaki Sato.Development of the Anglo-Saxon language and linguistic universals ;v. 1.Germanic languagesGrammarLinguistic universalsEnglish languageGrammarEnglish languageOld English, ca. 450-1100Germanic languagesGrammar.Linguistic universals.English languageGrammar.English language430/.045Askedal John Ole1942-224046MiAaPQMiAaPQMiAaPQBOOK9910785031803321Germanic languages and linguistic universals3803465UNINA03608nam 22007212 450 991082198540332120151005020622.01-107-22177-31-283-11116-097866131111661-139-07652-30-511-97715-81-139-08334-11-139-07880-11-139-08107-11-139-07080-0(CKB)2670000000093843(EBL)691988(OCoLC)726734811(SSID)ssj0000523591(PQKBManifestationID)11333399(PQKBTitleCode)TC0000523591(PQKBWorkID)10542705(PQKB)11558967(UkCbUP)CR9780511977152(Au-PeEL)EBL691988(CaPaEBR)ebr10470664(CaONFJC)MIL311116(MiAaPQ)EBC691988(PPN)189906545(EXLCZ)99267000000009384320101013d2011|||| uy| 0engur|||||||||||txtrdacontentcrdamediacrrdacarrierIterative methods in combinatorial optimization /Lap Chi Lau, R. Ravi, Mohit Singh[electronic resource]Cambridge :Cambridge University Press,2011.1 online resource (xi, 242 pages) digital, PDF file(s)Cambridge texts in applied mathematics ;46Title from publisher's bibliographic system (viewed on 05 Oct 2015).0-521-18943-8 1-107-00751-8 Includes bibliographical references and index.Machine generated contents note: 1. Introduction; 2. Preliminaries; 3. Matching and vertex cover in bipartite graphs; 4. Spanning trees; 5. Matroids; 6. Arborescence and rooted connectivity; 7. Submodular flows and applications; 8. Network matrices; 9. Matchings; 10. Network design; 11. Constrained optimization problems; 12. Cut problems; 13. Iterative relaxation: early and recent examples; 14. Summary.With the advent of approximation algorithms for NP-hard combinatorial optimization problems, several techniques from exact optimization such as the primal-dual method have proven their staying power and versatility. This book describes a simple and powerful method that is iterative in essence and similarly useful in a variety of settings for exact and approximate optimization. The authors highlight the commonality and uses of this method to prove a variety of classical polyhedral results on matchings, trees, matroids and flows. The presentation style is elementary enough to be accessible to anyone with exposure to basic linear algebra and graph theory, making the book suitable for introductory courses in combinatorial optimization at the upper undergraduate and beginning graduate levels. Discussions of advanced applications illustrate their potential for future application in research in approximation algorithms.Cambridge texts in applied mathematics ;46.Iterative methods (Mathematics)Combinatorial optimizationIterative methods (Mathematics)Combinatorial optimization.518/.26COM000000bisacshLau Lap Chi1654147Ravi R(Ramamoorthi),1969-Singh MohitUkCbUPUkCbUPBOOK9910821985403321Iterative methods in combinatorial optimization4005802UNINA