Mostrando 6,081 - 6,100 Resultados de 7,110 Para Buscar 'Anjar~', tiempo de consulta: 0.87s Limitar resultados
  1. 6081
    por Martines, Vicent
    Publicado 1991
    Libro
  2. 6082
    Publicado 2004
    Libro
  3. 6083
    Publicado 2020
    Libro
  4. 6084
    por Donoso Jiménez, Isaac
    Publicado 2006
    Libro
  5. 6085
    por Ferrater, Carlos, 1944-
    Publicado 2000
    Libro
  6. 6086
    por Gausa, Manuel
    Publicado 1998
    Libro
  7. 6087
    por Gausa, Manuel
    Publicado 1999
    Libro
  8. 6088
    Publicado 2002
    Libro
  9. 6089
    por Cortés, José Miguel G., 1955-
    Publicado 2006
    Libro
  10. 6090
    por Miàs, Josep
    Publicado 2009
    Libro
  11. 6091
    por Zuzunaga, Mariano, 1953-
    Publicado 2008
    Libro
  12. 6092
    Libro
  13. 6093
    por Formiguera, Pere, 1952-2013
    Publicado 2000
    Libro
  14. 6094
    Publicado 2017
    Tabla de Contenidos: “…-- The graph ADT -- Representation of a graph in memory -- Adjacency matrix -- Complexity of operations in a sparse adjacency matrix graph -- More space-efficient adjacency-matrix-based graph -- Complexity of operations in a dense adjacency-matrix-based graph -- Adjacency list -- Complexity of operations in an adjacency-list-based graph -- Adjacency-list-based graph with dense storage for vertices -- Complexity of the operations of an adjacency-list-based graph with dense storage for vertices -- Traversal of a graph -- Complexity of traversals -- Cycle detection -- Complexity of the cycle detection algorithm -- Spanning tree and minimum spanning tree -- For any tree with vertices V and edges E, |V| = |E| + 1 -- Any connected undirected graph has a spanning tree -- Any undirected connected graph with the property |V| = |E| + 1 is a tree -- Cut property -- Minimum spanning tree is unique for a graph that has all the edges whose costs are different from one another -- Finding the minimum spanning tree -- Union find -- Complexity of operations in UnionFind -- Implementation of the minimum spanning tree algorithm -- Complexity of the minimum spanning tree algorithm -- Summary -- Chapter 11: Reactive Programming…”
    Libro electrónico
  15. 6095
    Publicado 2005
    Electrónico
  16. 6096
    por Berg, Alban, 1885-1935
    Publicado 1983
    Disco musical
  17. 6097
    Publicado 2010
    Tabla de Contenidos: “…The internet ate my business 2 The era of creative disruption 3 The incumbent s dilemma - and solution 4 The checklist: critical factors for successful reinvention 5 Transform the core 6 Find big adjacencies 7 Innovate at the edges 8 Putting it all together Kodak s long road back 9 Out of print: the reinvention of book publishers Epilogue: what happens next? …”
    Libro electrónico
  18. 6098
    por Sanson, Kevin, author
    Publicado 2024
    Tabla de Contenidos: “…Here to Help: Service Producers and the Labor of Film Friendliness -- 4. Crew Adjacent: Location Experts, Spatial Creativity, and Logistical Quagmires -- 5. …”
    Libro electrónico
  19. 6099
    Publicado 2017
    “…Malauradament, aquest contingut no és fàcilment accessible: Una persona interessada en anar-se'n de vacances a un hotel probablement llegirà unes quantes experiències d'altra gent que ha anat prèviament a aquest hotel per descobrir que n'opinen, però segurament no podrà llegir-les totes. …”
    Accés lliure
    Tesis
  20. 6100
    CDROM