LEADER 01373nam0 22003371i 450 001 UON00297855 005 20251117113438.609 010 $a88-88645-12-8 100 $a20070626d2004 |0itac50 ba 101 $aita 102 $aIT 105 $a|||| ||||| 200 1 $aPolicarpo Quaresima$fAlfonso Henriques de Lima Barreto 210 $aRoma$cPericle Tangerine$d2004 215 $aXXIII, 290 p.$d21 cm 316 $adono prof. Chambers$5IT-UONSI BrasIII/0788 410 1$1001UON00297865$12001 $aKali Yuga. Collana di narrativa$1210 $aRoma$cPericle Tangerine$v7 500 1$3UON00376932$aTriste fim de Policarpo Quaresma$954950 620 $aIT$dRoma$3UONL000004 676 $a869.899203$cNarrativa brasiliana in portoghese$v21 700 1$aBARRETO$bAlfonso Henriques de Lima$3UONV171296$0695238 702 1$aBORGIA$bOmbretta$3UONV171297 702 1$aMAGALDI$bSergio$3UONV171299 702 1$aRicciardi$bGiovanni$3UONV111690 712 $aPericle Tangerine$3UONV273573$4650 801 $aIT$bSOL$c20251121$gRICA 899 $aSIBA - SISTEMA BIBLIOTECARIO DI ATENEO$2UONSI 912 $aUON00297855 950 $aSIBA - SISTEMA BIBLIOTECARIO DI ATENEO$dSI III 0788 $eSI DA 1609 5 0788 dono prof. Chambers 996 $aTriste fim de Policarpo Quaresma$954950 997 $aUNIOR LEADER 05245nam 22007935 450 001 9910485030803321 005 20251226203837.0 010 $a3-642-01009-1 024 7 $a10.1007/978-3-642-01009-5 035 $a(CKB)1000000000718118 035 $a(SSID)ssj0000317576 035 $a(PQKBManifestationID)11251843 035 $a(PQKBTitleCode)TC0000317576 035 $a(PQKBWorkID)10294823 035 $a(PQKB)11227937 035 $a(DE-He213)978-3-642-01009-5 035 $a(MiAaPQ)EBC3064100 035 $a(PPN)134131231 035 $a(EXLCZ)991000000000718118 100 $a20100301d2009 u| 0 101 0 $aeng 135 $aurnn#008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aEvolutionary Computation in Combinatorial Optimization $e9th European Conference, EvoCOP 2009, Tübingen, Germany, April 15-17, 2009, Proceedings /$fedited by Carlos Cotta, Peter I. Cowling 205 $a1st ed. 2009. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2009. 215 $a1 online resource (XIV, 253 p.) 225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v5482 300 $aBibliographic Level Mode of Issuance: Monograph 311 08$a3-642-01008-3 320 $aIncludes bibliographical references and index. 327 $aA Critical Element-Guided Perturbation Strategy for Iterated Local Search -- A Genetic Algorithm for Net Present Value Maximization for Resource Constrained Projects -- A Hybrid Algorithm for Computing Tours in a Spare Parts Warehouse -- A New Binary Description of the Blocks Relocation Problem and Benefits in a Look Ahead Heuristic -- A Plasmid Based Transgenetic Algorithm for the Biobjective Minimum Spanning Tree Problem -- A Tabu Search Algorithm with Direct Representation for Strip Packing -- An ACO Approach to Planning -- An Artificial Immune System for the Multi-Mode Resource-Constrained Project Scheduling Problem -- Beam-ACO Based on Stochastic Sampling for Makespan Optimization Concerning the TSP with Time Windows -- Binary Exponential Back Off for Tabu Tenure in Hyperheuristics -- Diversity Control and Multi-Parent Recombination for Evolutionary Graph Coloring Algorithms -- Divide-And-Evolve Facing State-of-the-Art Temporal Planners during the 6 th International Planning Competition -- Exact Solutions to the Traveling Salesperson Problem by a Population-Based Evolutionary Algorithm -- Finding Balanced Incomplete Block Designs with Metaheuristics -- Guided Ejection Search for the Job Shop Scheduling Problem -- Improving Performance in Combinatorial Optimisation Using Averaging and Clustering -- Iterated Local Search for Minimum Power Symmetric Connectivity in Wireless Networks -- Metropolis and Symmetric Functions: A Swan Song -- Robustness Analysis in Evolutionary Multi-Objective Optimization Applied to VAR Planning in Electrical Distribution Networks -- Staff Scheduling with Particle Swarm Optimisation and Evolution Strategies -- University Course Timetabling with Genetic Algorithm: A Laboratory Excercises Case Study. 330 $aThis book constitutes the refereed proceedings of the 9th European Conference on Evolutionary Computation in Combinatorial Optimization, EvoCOP 2009, held in Tübingen, Germany, in April 2009. The 21 revised full papers presented were carefully reviewed and selected from 53 submissions. The papers present the latest research and discuss current developments and applications in metaheuristics - a paradigm to effectively solve difficult combinatorial optimization problems appearing in various industrial, economical, and scientific domains. Prominent examples of metaheuristics are evolutionary algorithms, simulated annealing, tabu search, scatter search, memetic algorithms, variable neighborhood search, iterated local search, greedy randomized adaptive search procedures, estimation of distribution algorithms and ant colony optimization. 410 0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v5482 606 $aComputer science 606 $aAlgorithms 606 $aNumerical analysis 606 $aComputer science$xMathematics 606 $aDiscrete mathematics 606 $aBioinformatics 606 $aTheory of Computation 606 $aAlgorithms 606 $aNumerical Analysis 606 $aDiscrete Mathematics in Computer Science 606 $aComputational and Systems Biology 615 0$aComputer science. 615 0$aAlgorithms. 615 0$aNumerical analysis. 615 0$aComputer science$xMathematics. 615 0$aDiscrete mathematics. 615 0$aBioinformatics. 615 14$aTheory of Computation. 615 24$aAlgorithms. 615 24$aNumerical Analysis. 615 24$aDiscrete Mathematics in Computer Science. 615 24$aComputational and Systems Biology. 676 $a004.0151 701 $aCotta$b Carlos$01752546 701 $aCowling$b Peter$01752547 712 12$aEvoCOP (Conference) 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910485030803321 996 $aEvolutionary computation in combinatorial optimization$94187868 997 $aUNINA