LEADER 02260oam 2200685I 450 001 9910461246403321 005 20181122172237.0 010 $a0-429-90138-0 010 $a0-429-47661-2 010 $a1-283-12497-1 010 $a9786613124975 010 $a1-84940-186-1 035 $a(CKB)2670000000094803 035 $a(EBL)712310 035 $a(OCoLC)729167053 035 $a(SSID)ssj0000523832 035 $a(PQKBManifestationID)12223046 035 $a(PQKBTitleCode)TC0000523832 035 $a(PQKBWorkID)10545416 035 $a(PQKB)10371289 035 $a(MiAaPQ)EBC712310 035 $a(Au-PeEL)EBL712310 035 $a(CaPaEBR)ebr10477668 035 $a(CaONFJC)MIL312497 035 $a(OCoLC)738434107 035 $a(FlBoTFG)9780429476617 035 $a(EXLCZ)992670000000094803 100 $a20181122h20181995 uy 0 101 0 $aeng 135 $aur||| ||||| 181 $ctxt 182 $cc 183 $acr 200 10$aLearning Consultation $eA Systemic Framework /$fby David Campbell 205 $aFirst edition. 210 1$aBoca Raton, FL :$cRoutledge,$d[2018]. 210 4$d©1995. 215 $a1 online resource (179 p.) 225 1 $aSystemic thinking and practice series. Work with organizations 300 $aDescription based upon print version of record. 311 $a0-367-10482-2 311 $a1-85575-117-8 320 $aIncludes bibliographical references and index. 327 $apt. 1. The seminars -- pt. 2. The applications. 330 3 $aA book which will illuminate the learning process from the perspective of the teacher as well as the learner. The experiences of the various contributors will empower the reader to take more personal risks in their own learning. 410 0$aSystemic thinking and practice series.$pWork with organizations. 606 $aLearning 606 $aOrganizational learning 608 $aElectronic books. 615 0$aLearning. 615 0$aOrganizational learning. 676 $a658.4/6 676 $a668.4601 700 $aCampbell$b David$0344552 801 0$bFlBoTFG 801 1$bFlBoTFG 906 $aBOOK 912 $a9910461246403321 996 $aLearning Consultation$92016679 997 $aUNINA LEADER 01112nam a22002651i 4500 001 991004084419707536 005 20040719093028.0 008 040802s1966 it a||||||||||||||||ita 035 $ab13170727-39ule_inst 035 $aARCHE-112333$9ExL 040 $aBiblioteca Interfacoltà$bita$cA.t.i. Arché s.c.r.l. Pandora Sicilia s.r.l. 082 04$a759.5 100 1 $aCiardi Dupré Dal Poggetto, Maria Grazia$0422379 245 10$aDomenico Beccafumi /$c[Maria Grazia Ciardi Dupré Dal Poggetto] 260 $aMilano :$bFabbri,$cc1966 300 $a1 v. :$bill. ;$c36 cm 440 2$aI maestri del colore ;$v117 600 14$aBeccafumi, Domenico 907 $a.b13170727$b02-04-14$c05-08-04 912 $a991004084419707536 945 $aLE002 Fondo Giudici Busta 28/015$g1$i2002000750006$lle002$nC. 1$o-$pE0.00$q-$rn$so $t0$u0$v0$w0$x0$y.i13810728$z05-08-04 945 $aLE009 ART.COLL.1/117$cV.117$g1$i2009000269965$lle009$o-$pE0.00$q-$rn$so $t0$u0$v0$w0$x0$y.i14383251$z01-03-07 996 $aDomenico Beccafumi$9312413 997 $aUNISALENTO 998 $ale002$ale009$b05-08-04$cm$da $e-$fita$git $h0$i1 LEADER 06119nam 22007455 450 001 9910595028203321 005 20251225203652.0 010 $a9783031160813 010 $a3031160819 024 7 $a10.1007/978-3-031-16081-3 035 $a(MiAaPQ)EBC7097836 035 $a(Au-PeEL)EBL7097836 035 $a(CKB)24866014900041 035 $a(PPN)26495288X 035 $a(BIP)85742454 035 $a(BIP)85277678 035 $a(DE-He213)978-3-031-16081-3 035 $a(EXLCZ)9924866014900041 100 $a20220917d2022 u| 0 101 0 $aeng 135 $aurcnu|||||||| 181 $ctxt$2rdacontent 182 $cc$2rdamedia 183 $acr$2rdacarrier 200 10$aAlgorithmic Aspects in Information and Management $e16th International Conference, AAIM 2022, Guangzhou, China, August 13?14, 2022, Proceedings /$fedited by Qiufen Ni, Weili Wu 205 $a1st ed. 2022. 210 1$aCham :$cSpringer International Publishing :$cImprint: Springer,$d2022. 215 $a1 online resource (482 pages) 225 1 $aLecture Notes in Computer Science,$x1611-3349 ;$v13513 311 08$aPrint version: Ni, Qiufen Algorithmic Aspects in Information and Management Cham : Springer International Publishing AG,c2022 9783031160806 320 $aIncludes bibliographical references and index. 327 $aAn improvement of the bound on the odd chromatic number of 1-planar graphs -- AoI Minimizing of Wireless Rechargeable Sensor Network based on Trajectory Optimization of Laser-Charged UAV -- Monotone k-Submodular Knapsack Maximization: An Analysis of the Greedy+Singleton Algorithm -- The constrained parallel-machine scheduling problem with divisible processing times and penalties -- Energy-constrained Geometric Covering Problem -- Fast searching on $k$-combinable graphs -- Three Algorithms for Converting Control Flow Statements from Python to XD-M -- Class Ramsey numbers involving induced graphs -- An Approximation Algorithm for the Clustered Path Travelling Salesman Problem -- Hyperspectral Image Reconstruction for SD-CASSI systems based on Residual Attention Network -- Improved Approximation Algorithm for the Asymmetric Prize-Collecting TSP -- Injective edge coloring of power graphs and necklaces -- Guarantees for Maximization of $k$-Submodular Functions with a Knapsack and a Matroid Constraint.-Incremental SDN Deployment to Achieve Load Balance in ISP Networks -- Approximation scheme for single-machine rescheduling with job delay and rejection -- Defense of Scapegoating Attack in Network Tomography -- A Binary Search Double Greedy Algorithm for Non-monotone DR-submodular Maximization -- Streaming Adaptive Submodular Maximization -- Constrained Stochastic Submodular Maximization with State-Dependent Costs -- Online early work maximization problem on two hierarchical machines with buffer or rearrangements -- Polynomial time algorithm for k-vertex-edge dominating problem in interval graphs -- Adaptive Competition-based Diversified-profit Maximization with Online Seed Allocation -- Collaborative Service Caching in Mobile Edge Nodes -- A Decentralized Auction Framework with Privacy Protection in Mobile Crowdsourcing -- On-line single machine scheduling with release dates and submodular rejection penalties -- Obnoxious Facility Location Games with Candidate Locations -- Profit Maximization for Multiple Products in Community-based Social Networks -- MCM: A Robust Map Matching Method by Tracking Multiple Road Candidates -- Security on Ethereum: Ponzi Scheme Detection in Smart Contract -- Cyclically orderable generalized Petersen graphs -- The r-dynamic chromatic number of planar graphs without special short cycles -- Distance Labeling of the Halved Folded $n$-Cube -- Signed network embedding based on muti-attention mechanism -- Balanced Graph Partitioning based on Mixed 0-1 Linear Programming and Iteration Vertex Relocation Algorithm -- Partial inverse min-max spanning tree problem under the weighted bottleneck Hamming distance -- Mixed Metric Dimension of Some Plane Graphs -- The Optimal Dynamic Rationing Policy in the Stock-Rationing Queue -- Pilot Pattern Design with Branch and Bound in PSA-OFDM System -- Bicriteria Algorithms for Maximizing the Difference Between Submodular Function and Linear Function under Noise -- On the Transversal Number of k-Uniform Connected Hypergraphs.-Total coloring of planar graphs without some adjacent cycles. 330 $aThis book constitutes the proceedings of the 16th International Conference on Algorithmic Aspects in Information and Management, AAIM 2022, which was held online during August 13-14, 2022. The conference was originally planned to take place in Guangzhou, China, but changed to a virtual event due to the COVID-19 pandemic. The 41 regular papers included in this book were carefully reviewed and selected from 59 submissions. . 410 0$aLecture Notes in Computer Science,$x1611-3349 ;$v13513 606 $aComputer science$xMathematics 606 $aDiscrete mathematics 606 $aData structures (Computer science) 606 $aInformation theory 606 $aArtificial intelligence 606 $aComputer science 606 $aDiscrete Mathematics in Computer Science 606 $aData Structures and Information Theory 606 $aArtificial Intelligence 606 $aTheory of Computation 615 0$aComputer science$xMathematics. 615 0$aDiscrete mathematics. 615 0$aData structures (Computer science) 615 0$aInformation theory. 615 0$aArtificial intelligence. 615 0$aComputer science. 615 14$aDiscrete Mathematics in Computer Science. 615 24$aData Structures and Information Theory. 615 24$aArtificial Intelligence. 615 24$aTheory of Computation. 676 $a929.605 676 $a005.1 702 $aNi$b Qiufen 702 $aWu$b Weili 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910595028203321 996 $aAlgorithmic Aspects in Information and Management$9771920 997 $aUNINA