Synonyma magistri Iohannis de garlandia cum expositione magistri galfridi anglici: de rece[n]titam in versibus in sententiis ortographiaq[ue] diligentissime London correcta impressa [[electronic resource]]

• Record Nr.: UNISA996383735203316
• Autore: John, of Garland, <ca. 1195-ca. 1272.>
• Pubbl/distr/stampa: [London[iis], : Impressus per Richardu[m] Pynson, feliciter finit, Anno incarnati verbi. M. CCCC. Lxxxxvi] [1496]
• Descrizione fisica: [132] p
• Altri autori (Persone): Galfridus, Anglicus, <fl. 1440.>
• Soggetti: Latin language - Synonyms and antonyms
• Lingua di pubblicazione: Latino
• Formato: Materiale a stampa
• Livello bibliografico: Monografia
• Note generali: An edition of: Synonyma.; Imprint from colophon.; Signatures: A-L⁶.; Last leaf blank.; Reproductions of the originals in the British Library and the Bodleian Library.; Appears at reel 101 (British Library copy), reel 149 and at reel 161 (both are Bodleian Library copy).
• Sommario/riassunto: eebo-0014

Verso una nuova saggezza : Conversazioni con Gregory Bateson, Indira Gandhi, Werner Heisenberg, Krishnamurti, Ronald David Laing, Ernest F. Schumacher, Alan Watts e altri personaggi straordinari / Fritjof Capra ; traduzione di Libero Sosio

• Record Nr.: UNINA990004174140403321
• Autore: Capra, Fritjof
• Pubbl/distr/stampa: Milano, : Feltrinelli, 1988
• ISBN: 88-07-08067-2
• Descrizione fisica: 303 p. ; 22 cm
• Locazione: FLFBC; DFD
• Collocazione: 125 CAPF 02; XI F C 23
• Lingua di pubblicazione: Italiano
• Formato: Materiale a stampa
• Livello bibliografico: Monografia

Efficient approximation and online algorithms : recent progress on classical combinatorial optimization problems and new applications / / Evripidis Bampis, Klaus Jansen, Claire Kenyon (eds.)

• Record Nr.: UNINA9910484229603321
• Pubbl/distr/stampa: New York, : Springer, 2006
• ISBN: 3-540-32213-2
• Edizione: [1st ed. 2006.]
• Descrizione fisica: 1 online resource (VII, 349 p.)
• Collana: Lecture notes in computer science, , 0302-9743 ; ; 3484; LNCS sublibrary. SL 1, Theoretical computer science and general issues
• Altri autori (Persone): BampisEvripidis; JansenKlaus; KenyonClaire
• Disciplina: 005.1
• Soggetti: Computer algorithms; Online algorithms; Combinatorial optimization - Data processing
• Lingua di pubblicazione: Inglese
• Formato: Materiale a stampa
• Livello bibliografico: Monografia
• Note generali: Bibliographic Level Mode of Issuance: Monograph
• Nota di bibliografia: Includes bibliographical references and index.
• Nota di contenuto: Contributed Talks -- On Approximation Algorithms for Data Mining Applications -- A Survey of Approximation Results for Local Search Algorithms -- Approximation Algorithms for Path Coloring in Trees -- Approximation Algorithms for Edge-Disjoint Paths and Unsplittable Flow -- Independence and Coloring Problems on Intersection Graphs of Disks -- Approximation Algorithms for Min-Max and Max-Min Resource Sharing Problems, and Applications -- A Simpler Proof of Preemptive Total Flow Time Approximation on Parallel Machines -- Approximating a Class of Classification Problems -- List Scheduling in Order of ?-Points on a Single Machine -- Approximation Algorithms for the k-Median Problem -- The Lovász-Local-Lemma and Scheduling.
• Sommario/riassunto: This book provides a good opportunity for computer science practitioners and researchers to get in sync with current state-of-the-art and future trends in the field of combinatorial optimization and online algorithms. Recent advances in this area are presented focusing on the design of efficient approximation and on-line algorithms. One central idea in the book is to use a linear program relaxation of the ; problem, randomization and rounding techniques.