05993nam 22007815 450 99646528010331620200705201755.03-540-68880-310.1007/978-3-540-68880-8(CKB)1000000000440773(SSID)ssj0000316147(PQKBManifestationID)11273107(PQKBTitleCode)TC0000316147(PQKBWorkID)10263641(PQKB)10201763(DE-He213)978-3-540-68880-8(MiAaPQ)EBC3068585(PPN)127051538(EXLCZ)99100000000044077320100301d2008 u| 0engurnn#008mamaatxtccrAlgorithmic Aspects in Information and Management[electronic resource] 4th International Conference, AAIM 2008, Shanghai, China, June 23-25, 2008, Proceedings /edited by Rudolf Fleischer, Jinhui Xu1st ed. 2008.Berlin, Heidelberg :Springer Berlin Heidelberg :Imprint: Springer,2008.1 online resource (XI, 352 p.)Information Systems and Applications, incl. Internet/Web, and HCI ;5034Bibliographic Level Mode of Issuance: Monograph3-540-68865-X Includes bibliographical references and index.Double Partition: (6?+??)-Approximation for Minimum Weight Dominating Set in Unit Disk Graphs -- Nash Bargaining Via Flexible Budget Markets -- On the Minimum Hitting Set of Bundles Problem -- Speed Scaling with a Solar Cell -- Engineering Label-Constrained Shortest-Path Algorithms -- New Upper Bounds on Continuous Tree Edge-Partition Problem -- A Meeting Scheduling Problem Respecting Time and Space -- Fixed-Parameter Algorithms for Kemeny Scores -- The Distributed Wireless Gathering Problem -- Approximating Maximum Edge 2-Coloring in Simple Graphs Via Local Improvement -- An Improved Randomized Approximation Algorithm for Maximum Triangle Packing -- Line Facility Location in Weighted Regions -- Algorithms for Temperature-Aware Task Scheduling in Microprocessor Systems -- Engineering Comparators for Graph Clusterings -- On the Fast Searching Problem -- Confidently Cutting a Cake into Approximately Fair Pieces -- Copeland Voting Fully Resists Constructive Control -- The Complexity of Power-Index Comparison -- Facility Location Problems: A Parameterized View -- Shortest Path Queries in Polygonal Domains -- A Fast 2-Approximation Algorithm for the Minimum Manhattan Network Problem -- Minimum Cost Homomorphism Dichotomy for Oriented Cycles -- Minimum Leaf Out-Branching Problems -- Graphs and Path Equilibria -- No l Grid-Points in Spaces of Small Dimension -- The Secret Santa Problem -- Finding Optimal Refueling Policies in Transportation Networks -- Scale Free Interval Graphs -- On Representation of Planar Graphs by Segments -- An Optimal On-Line Algorithm for Preemptive Scheduling on Two Uniform Machines in the ? p Norm -- An Optimal Strategy for Online Non-uniform Length Order Scheduling -- Large-Scale Parallel Collaborative Filtering for the Netflix Prize.This book constitutes the refereed proceedings of the 4th International Conference on Algorithmic Aspects in Information and Management, AAIM 2008, held in Shanghai, China, in June 2008. The 30 revised full papers presented together with abstracts of 2 invited talks were carefully reviewed and selected from 53 submissions. The papers cover original algorithmic research on immediate applications and/or fundamental problems pertinent to information management and management science. Topics addressed are: approximation algorithms, geometric data management, biological data management, graph algorithms, computational finance, mechanism design, computational game theory, network optimization, data structures, operations research, discrete optimization, online algorithms, FPT algorithms, and scheduling algorithms.Information Systems and Applications, incl. Internet/Web, and HCI ;5034Software engineeringAlgorithmsData structures (Computer science)Computer science—MathematicsNumerical analysisMathematical statisticsSoftware Engineering/Programming and Operating Systemshttps://scigraph.springernature.com/ontologies/product-market-codes/I14002Algorithm Analysis and Problem Complexityhttps://scigraph.springernature.com/ontologies/product-market-codes/I16021Data Structureshttps://scigraph.springernature.com/ontologies/product-market-codes/I15017Discrete Mathematics in Computer Sciencehttps://scigraph.springernature.com/ontologies/product-market-codes/I17028Numeric Computinghttps://scigraph.springernature.com/ontologies/product-market-codes/I1701XProbability and Statistics in Computer Sciencehttps://scigraph.springernature.com/ontologies/product-market-codes/I17036Software engineering.Algorithms.Data structures (Computer science).Computer science—Mathematics.Numerical analysis.Mathematical statistics.Software Engineering/Programming and Operating Systems.Algorithm Analysis and Problem Complexity.Data Structures.Discrete Mathematics in Computer Science.Numeric Computing.Probability and Statistics in Computer Science.005.1Fleischer Rudolfedthttp://id.loc.gov/vocabulary/relators/edtXu Jinhuiedthttp://id.loc.gov/vocabulary/relators/edtAAIM 2005BOOK996465280103316Algorithmic Aspects in Information and Management771920UNISA01321nam0 22003253i 450 LO1025168820231121125516.0IT1894 6286 20150202d1894 ||||0itac50 baitalatitz01i xxxe z01nPiccola grammatica latinaFerdinando Schultzinteramente rifusa [da] Martino Wetzelunica traduzione italiana autorizzata ... a cura di Luigi ValmaggiTorinoLoescher1894VIII, 304 p.19 cm.475Grammatica del latino classico.22Schultz, FerdinandRAVV061290070455834Wetzel, MartinLO1V086047Valmaggi, LuigiRAVV075236Schultz, FerdinandoCFIV221628Schultz, FerdinandSchultz, Ferdinand <1814-1893>RT1V039807Schultz, FerdinandITIT-0120150202IT-FR0017 Biblioteca umanistica Giorgio ApreaFR0017 NLO10251688Biblioteca umanistica Giorgio Aprea 52DFV A 41 52BUN0000121165 VMM Volume privo del frontespizio.B 2015020220150202 52Piccola grammatica latina168623UNICAS