Mostrando 1 - 12 Resultados de 12 Para Buscar '"Luleå"', tiempo de consulta: 0.04s Limitar resultados
  1. 1
    por Kranz, Matthias
    Publicado 2013
    “…12th International Conference on Mobile and Ubiquitous Multimedia, Luleå, Sweden - December 02 - 05, 2013…”
    Libro electrónico
  2. 2
    Publicado 1989
    Libro
  3. 3
  4. 4
    Publicado 1994
    Revista digital
  5. 5
    Publicado 2011
    Revista digital
  6. 6
    por Nauwelaers, Claire
    Publicado 2013
    “…Luleå (Sweden) has recently attracted the European Facebook data centre. …”
    Capítulo de libro electrónico
  7. 7
    por Messiaen, Olivier, 1908-1992
    Publicado 1989
    Disco musical
  8. 8
    por Messiaen, Olivier, 1908-1992
    Publicado 1989
    CDROM
  9. 9
    Publicado 2000
    Revista digital
  10. 10
    por Messiaen, Olivier, 1908-1992
    Publicado 1992
    Disco musical
  11. 11
    Publicado 2010
    Tabla de Contenidos: “…Walter Fernández Australian National University Birgitta Bergvall-Kåreborn Luleå University of Technology Michael Djordjevic Keith Lovegrove Javier Fernández-Velasco Mishka Talent Australian National University; 9. …”
    Libro electrónico
  12. 12
    Publicado 2022
    Tabla de Contenidos: “…-- 11.1.3 Lookup model -- 11.2 Finessing lookups -- 11.2.1 Threaded indices and tag switching -- 11.2.2 Flow switching -- 11.2.3 Status of tag switching, flow switching, and multiprotocol label switching -- 11.3 Non-algorithmic techniques for prefix matching -- 11.3.1 Caching -- 11.3.2 Ternary content-addressable memories -- 11.4 Unibit tries -- 11.5 Multibit tries -- 11.5.1 Fixed-stride tries -- 11.5.2 Variable-stride tries -- 11.5.3 Incremental update -- 11.6 Level-compressed (LC) tries -- 11.7 Lulea-compressed tries -- 11.8 Tree bitmap -- 11.8.1 Tree bitmap ideas -- 11.8.2 Tree bitmap search algorithm -- 11.8.3 PopTrie: an alternate bitmap algorithm -- 11.9 Binary search on ranges -- 11.10 Binary search on ranges with Initial Lookup Table -- 11.11 Binary search on prefix lengths -- 11.12 Linear search on prefix lengths with hardware assist -- 11.12.1 Using Bloom Filters to compress prefix bitmaps -- 11.12.2 SAIL: Uncompressed Bitmaps up to a pivot level -- 11.13 Memory allocation in compressed schemes -- 11.13.1 Frame-based compaction -- 11.14 Fixed Function Lookup-chip models -- 11.15 Programmable Lookup Chips and P4 -- 11.15.1 The P4 language -- 11.15.2 IP Lookups in the P4 Model -- 11.16 Conclusions -- 11.17 Exercises -- 12 Packet classification -- 12.1 Why packet classification? …”
    Libro electrónico