{"text_format":"2","workbook":"xls","n_sheets":1,"sheets":["report2"],"not_rendered":{"charts":0,"images":0,"macros":0,"external_links":1,"defined_names":3,"comments":0,"pivot_tables":0},"unopened":[],"bounds":{"document_bytes":16777216,"sheet_cells":100000,"run_cost":"one","rows_first":2000,"rows_last":500,"rows_between":2000,"halvings":0,"cell_chars":16384,"cell_head_chars":4096},"cells_cut":0,"cells_raw":0,"read":"whole","date_system":"1900","formulas":"cached_only"}

{"sheet":"report2","index":0,"n_rows":62,"n_cols":5,"rows_kept":62,"cut":false,"hidden":false,"merged":[[0,2,0,3],[0,4,0,5],[1,2,1,3],[1,4,1,5],[2,2,2,3],[2,4,2,5],[3,2,3,3],[4,2,4,3],[5,2,5,3],[6,2,6,3],[7,2,7,3],[8,2,8,3],[11,2,11,3],[12,2,12,3],[14,2,14,3],[14,4,14,5],[15,2,15,3],[15,4,15,5],[16,2,16,3],[16,4,16,5],[17,2,17,3],[18,2,18,3],[19,2,19,3],[20,2,20,3],[21,2,21,3],[22,2,22,3],[23,2,23,3],[26,2,26,3],[26,4,26,5],[27,2,27,3],[27,4,27,5],[28,2,28,3],[29,2,29,3],[32,2,32,3],[33,2,33,3],[34,2,34,3],[35,2,35,3],[43,2,43,3],[44,2,44,3],[54,2,54,3],[55,2,55,3],[59,2,59,3]],"flags":["formulas_cached_only"]}
[null,"1.","Record Nr.",null,"UNISALENTO991004189669707536"]
[null,null,"Autore",null,"Praz, Mario"]
[null,null,"Titolo",null,"La carne, la morte e il diavolo nella letteratura romantica / Mario Praz"]
[null,null,"Pubbl/distr/stampa",null,"Firenze : Sansoni, 1986"]
[null,null,"ISBN",null,"8838313407"]
[null,null,"Descrizione fisica",null,"XIX, 448 p., 37 c. di tav. ; 21 cm"]
[null,null,"Collana",null,"Biblioteca universale Sansoni"]
[null,null,"Disciplina",null,"809.91"]
[null,null,"Soggetti",null,"Romanticismo"]
[{"$nulls":4},"Erotismo nella letteratura"]
[{"$nulls":4},"Letteratura - Europa"]
[null,null,"Lingua di pubblicazione",null,"Italiano"]
[null,null,"Formato",null,"Materiale a stampa"]
[null,null,null,"Livello bibliografico","Monografia"]
[null,"2.","Record Nr.",null,"UNINA9910806582303321"]
[null,null,"Autore",null,"Di Bello, Anna"]
[null,null,"Titolo",null,"Riflessioni gramsciane sull'origine dello Stato moderno: Jean Bodin / di Anna Di Bello"]
[null,null,"Pubbl/distr/stampa",null,"Napoli, : Liguori, 2011"]
[null,null,"Descrizione fisica",null,"2, 106-115 p. ; 20 cm"]
[null,null,"Collana",null,"Quaderni del Dipartimento di filosofia e politica, Università degli studi di Napoli L'Orientale ; 41"]
[null,null,"Locazione",null,"FLFBC"]
[null,null,"Collocazione",null,"DFT OPUSC. 08 (21)"]
[null,null,"Lingua di pubblicazione",null,"Italiano"]
[null,null,"Formato",null,"Materiale a stampa"]
[null,null,null,"Livello bibliografico","Monografia"]
[null,null,null,"Note generali","Estratto da: Marx e Gramsci: filologia, filosofia e politica allo specchio : atti del Convegno internazionale organizzato dal Dipartimento di filosofia e politica dell'Università degli studi di Napoli L'Orientale con il patrocinio dell'Istituto Fondazione Gramsci di Roma e dell'Associazione italiana degli storici delle dottrine politiche, Napoli, 4-5 dicembre 2008 / a cura di Anna Di Bello"]
[null,"3.","Record Nr.",null,"UNINA9910483991103321"]
[null,null,"Titolo",null,"Evolutionary Computation in Combinatorial Optimization : 10th European Conference, EvoCOP 2010, Istanbul, Turkey, April 7-9, 2010, Proceedings / / edited by Peter I. Cowling, Peter Merz"]
[null,null,"Pubbl/distr/stampa",null,"Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2010"]
[null,null,"ISBN",null,"1-280-38599-5"]
[{"$nulls":4},"9786613563910"]
[{"$nulls":4},"3-642-12139-X"]
[null,null,"Edizione",null,"[1st ed. 2010.]"]
[null,null,"Descrizione fisica",null,"1 online resource (XII, 290 p. 67 illus.)"]
[null,null,"Collana",null,"Theoretical Computer Science and General Issues, , 2512-2029 ; ; 6022"]
[null,null,"Classificazione",null,"54.10"]
[{"$nulls":4},"31.12"]
[{"$nulls":4},"31.76"]
[{"$nulls":4},"30.10"]
[{"$nulls":4},"DAT 718f"]
[{"$nulls":4},"MAT 913f"]
[{"$nulls":4},"MAT 919f"]
[{"$nulls":4},"SS 4800"]
[null,null,"Disciplina",null,"005.1"]
[null,null,"Soggetti",null,"Algorithms"]
[{"$nulls":4},"Computer science"]
[{"$nulls":4},"Pattern recognition systems"]
[{"$nulls":4},"Computer vision"]
[{"$nulls":4},"Computer science - Mathematics"]
[{"$nulls":4},"Discrete mathematics"]
[{"$nulls":4},"Theory of Computation"]
[{"$nulls":4},"Automated Pattern Recognition"]
[{"$nulls":4},"Computer Vision"]
[{"$nulls":4},"Discrete Mathematics in Computer Science"]
[null,null,"Lingua di pubblicazione",null,"Inglese"]
[null,null,"Formato",null,"Materiale a stampa"]
[null,null,null,"Livello bibliografico","Monografia"]
[null,null,null,"Note generali","Bibliographic Level Mode of Issuance: Monograph"]
[null,null,null,"Nota di bibliografia","Includes bibliographical references and index."]
[null,null,"Nota di contenuto",null,"Dual Sequence Simulated Annealing with Round-Robin Approach for University Course Timetabling -- Heuristic and Exact Methods for the Discrete (r /p)-Centroid Problem -- On the Benefit of Sub-optimality within the Divide-and-Evolve Scheme -- A Real-Integer-Discrete-"]
[{"$nulls":4},"Coded Differential Evolution Algorithm: A Preliminary Study -- Fitness Distance Correlation and Search Space Analysis for Permutation Based Problems -- A Genetic Algorithm to Minimize Chromatic Entropy -- Evolutionary Approaches to the Three-dimensional Multi-pipe Routing Problem: A Comparative Study Using Direct Encodings -- A Tabu Search Heuristic for Point Coverage, Sink Location, and Data Routing in Wireless Sensor Networks -- Ant Colony Optimization for Tree Decompositions -- Iterated Local Search with Path Relinking for Solving Parallel Machines Scheduling Problem with Resource-Assignable Sequence Dependent Setup Times -- Enhancing a Tabu Algorithm for Approximate Graph Matching by Using Similarity Measures -- Characterizing Fault-Tolerance of Genetic Algorithms in Desktop Grid Systems -- The Office-Space-Allocation Problem in Strongly Hierarchized Organizations -- A Study of Memetic Search with Multi-parent Combination for UBQP -- Bicriteria Scheduling Problem on the Two-Machine Flowshop Using Simulated Annealing -- A Memetic Algorithm for Workforce Distribution in Dynamic Multi-Skill Call Centres -- Geometric Generalization of the Nelder-Mead Algorithm -- Guided Ejection Search for the Pickup and Delivery Problem with Time Windows -- An Evolutionary Algorithm Guided by Preferences Elicited According to the ELECTRE TRI Method Principles -- Multilevel Variable Neighborhood Search for Periodic Routing Problems -- Enhancing Genetic Algorithms by a Trie-Based Complete Solution Archive -- A New Primal-Dual Genetic Algorithm: Case Study for the Winner Determination Problem -- Local Search Algorithms on Graphics Processing Units. A Case Study: The Permutation Perceptron Problem -- Efficient Cycle Search for the Minimum Routing Cost Spanning Tree Problem."]
[null,null,null,"Sommario/riassunto","Metaheuristicscontinuetodemonstratetheire'ectivenessforanever-broadening range of di'cult combinatorial optimization problems appearing in a wide - riety of industrial, economic, and scienti'c domains. Prominent examples of metaheuristics are evolutionary algorithms, tabu search, simulated annealing, scatter search, memetic algorithms, variable neighborhood search, iterated local search, greedy randomized adaptive search procedures, ant colony optimization and estimation of distribution algorithms. Problems solved successfully include scheduling,timetabling,networkdesign,transportationanddistribution,vehicle routing, the travelling salesman problem, packing and cutting, satis'ability and general mixed integer programming. EvoCOP began in 2001 and has been held annually since then. It is the ?rst event speci'cally dedicated to the application of evolutionary computation and related methods to combinatorial optimization problems. Originally held as a workshop,EvoCOPbecameaconferencein2004.Theeventsgaveresearchersan excellent opportunity to present their latest research and to discuss current - velopments and applications. Following the general trend of hybrid metaheur- tics and diminishing boundaries between the di'erent classes of metaheuristics, EvoCOPhas broadenedits scope in recent years and invited submissions on any kind of metaheuristic for combinatorial optimization."]