LEADER 00918nam0-22003131i-450 001 990002761670403321 005 20230703121258.0 035 $a000276167 035 $aFED01000276167 035 $a(Aleph)000276167FED01 035 $a000276167 100 $a20030910d1961----km-y0itay50------ba 101 0 $aeng 102 $aUS 105 $aa-------001yy 200 1 $aManagement games$ea new technique for executive development$fJoel M. Kibbee, Clifford J. Craft, Burt Nanus 210 $aNew York$cReinhold$d1961 215 $aXII, 343 p.$d24 cm 225 1 $aReinhold management reference series 700 1$aKibbee,$bJoel M.$0312823 701 1$aCraft,$bClifford J.$0312824 701 1$aNanus,$bBurt$0106408 801 0$aIT$bUNINA$gRICA$2UNIMARC 901 $aBK 912 $a990002761670403321 952 $a1-1-17$b571 ITA$fECA 959 $aECA 996 $aManagement games$9422371 997 $aUNINA LEADER 02610nam 2200553 a 450 001 9910778240603321 005 20200520144314.0 010 $a0-8173-8009-4 035 $a(CKB)1000000000483481 035 $a(EBL)438161 035 $a(OCoLC)209080349 035 $a(SSID)ssj0000233045 035 $a(PQKBManifestationID)11201120 035 $a(PQKBTitleCode)TC0000233045 035 $a(PQKBWorkID)10219591 035 $a(PQKB)11314053 035 $a(MdBmJHUP)muse8921 035 $a(Au-PeEL)EBL438161 035 $a(CaPaEBR)ebr10225584 035 $a(MiAaPQ)EBC438161 035 $a(EXLCZ)991000000000483481 100 $a20070416d2007 ub 0 101 0 $aeng 135 $aurcn||||||||| 181 $ctxt 182 $cc 183 $acr 200 10$aReading network fiction$b[electronic resource] /$fDavid Ciccoricco 210 $aTuscaloosa $cUniversity of Alabama Press$dc2007 215 $a1 online resource (258 p.) 300 $aDescription based upon print version of record. 311 $a0-8173-5816-1 311 $a0-8173-1589-6 320 $aIncludes bibliographical references (p. [221]-238) and index. 327 $aThe time and time again of network fiction -- Network vistas : folding the cognitive map -- Returning in twilight : Joyce's Twilight, a symphony -- Tending the garden plot : Moulthrop's Victory garden -- Fluid or overflowing : The unknown and *water writes always in *plural -- Mythology proceeding : Morrissey's The Jew's daughter. 330 $aThe marriage of narrative and the computer dates back to the 1980's, with the hypertext experiments of luminaries such as Judy Malloy and Michael Joyce. What has been variously called ""hypertext fiction,"" ""literary hypertext,"" and ""hyperfiction"" has surely surrendered any claim to newness in the 21st century. David Ciccoricco establishes the category of ""network fiction"" as distinguishable from other forms of hypertext and cybertext: network fictions are narrative texts in digitally networked environments that make use of hypertext technology in order to... 606 $aHypertext fiction$xHistory and criticism 606 $aExperimental fiction, American$xHistory and criticism 615 0$aHypertext fiction$xHistory and criticism. 615 0$aExperimental fiction, American$xHistory and criticism. 676 $a813/.60911 700 $aCiccoricco$b David$f1973-$01543390 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910778240603321 996 $aReading network fiction$93834094 997 $aUNINA LEADER 04911nam 22007455 450 001 9910484044003321 005 20251225205224.0 010 $a3-319-53007-0 024 7 $a10.1007/978-3-319-53007-9 035 $a(CKB)3710000001079933 035 $a(DE-He213)978-3-319-53007-9 035 $a(MiAaPQ)EBC6295125 035 $a(MiAaPQ)EBC5577516 035 $a(Au-PeEL)EBL5577516 035 $a(OCoLC)971892872 035 $a(PPN)198868480 035 $a(EXLCZ)993710000001079933 100 $a20170202d2017 u| 0 101 0 $aeng 135 $aurnn#008mamaa 181 $ctxt$2rdacontent 182 $cc$2rdamedia 183 $acr$2rdacarrier 200 10$aAlgorithms and Discrete Applied Mathematics $eThird International Conference, CALDAM 2017, Sancoale, Goa, India, February 16-18, 2017, Proceedings /$fedited by Daya Gaur, N.S. Narayanaswamy 205 $a1st ed. 2017. 210 1$aCham :$cSpringer International Publishing :$cImprint: Springer,$d2017. 215 $a1 online resource (XIX, 372 p. 72 illus.) 225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v10156 300 $aIncludes index. 311 08$a3-319-53006-2 327 $aOptimal embedding of locally twisted cubes into grids -- Polynomial Time Algorithms for Bichromatic Problems -- Voronoi Diagram for Convex Polygonal Sites with Convex Polygon-Offset Distance Function -- Optimum Gathering of Asynchronous Robots -- Improved bounds for poset sorting in the forbidden-comparison regime -- Positional Dominance: Concepts and Algorithms -- Accurate Low-Space Approximation of Metric k-Median for Insertion-Only Streams -- Querying Relational Event Graphs using Colored Range Searching Data Structures -- Axiomatic Characterization of the Interval Function of a Bipartite Graph -- Analysis of 2-Opt Heuristic for the Winner Determination Problem under the Chamberlin-Courant System -- On Structural Parameterizations of Graph Motif and Chromatic Number -- On chromatic number of colored mixed graphs -- Optimizing movement in a convex path-network to establish connectivity -- On colouring point visibility graphs -- Decomposing semi-complete multigraphs and directed graphs into paths of length two -- On Rank and MDR Cyclic codes of length 2k over Z8 -- Group Distance Magic Labeling ofCrn -- Broadcast Graphs Using New Dimensional Broadcast Schemes for Knödel Graphs -- Incremental algorithms to update visibility polygons -- Liar's Domination in 2D -- Structured Instances of Restricted Assignment with Two Processing Times -- Elusiveness of finding degrees -- Maximum weighted independent sets with a budget -- Demand hitting and covering of intervals -- Exact And Parameterized Algorithms For (k; i)-coloring -- The Graph of the Pedigree Polytope is Asymptotically Almost Complete. ? Induced matching in some subclasses of bipartite graphs -- Hamiltonicity in Split Graphs - a dichotomy -- Finding Large Independent Sets in Line of Sight Networks -- A lower bound of the cd-chromatic number and its complexity -- Stability number and k-Hamiltonian [a,b]-factors -- Subgraphs with orthogonal [0; ki]n1-factorizations in graphs. 330 $aThis book constitutes the proceedings of the Third International Conference on Algorithms and Discrete Applied Mathematics, CALDAM 2017, held in Goa, India, in February 2017. The 32 papers presented in this volume were carefully reviewed and selected from 103 submissions. They deal with the following areas: algorithms, graph theory, codes, polyhedral combinatorics, computational geometry, and discrete geometry. . 410 0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v10156 606 $aAlgorithms 606 $aArtificial intelligence$xData processing 606 $aComputer science$xMathematics 606 $aDiscrete mathematics 606 $aNumerical analysis 606 $aComputer graphics 606 $aAlgorithms 606 $aData Science 606 $aDiscrete Mathematics in Computer Science 606 $aNumerical Analysis 606 $aComputer Graphics 615 0$aAlgorithms. 615 0$aArtificial intelligence$xData processing. 615 0$aComputer science$xMathematics. 615 0$aDiscrete mathematics. 615 0$aNumerical analysis. 615 0$aComputer graphics. 615 14$aAlgorithms. 615 24$aData Science. 615 24$aDiscrete Mathematics in Computer Science. 615 24$aNumerical Analysis. 615 24$aComputer Graphics. 676 $a004.0151 702 $aGaur$b Daya$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aNarayanaswamy$b N.S$4edt$4http://id.loc.gov/vocabulary/relators/edt 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910484044003321 996 $aAlgorithms and Discrete Applied Mathematics$93004624 997 $aUNINA