1) La descarga del recurso depende de la página de origen
2) Para poder descargar el recurso, es necesario ser usuario registrado en Universia


Opción 1: Descargar recurso

Detalles del recurso

Descripción

I argue that power law research must move from focusing on observation, interpretation, and modeling of power law behavior to instead considering the challenging problems of validation of models and control of systems.

Pertenece a

Project Euclid (Hosted at Cornell University Library)  

Autor(es)

Mitzenmacher, Michael - 

Id.: 5707183

Idioma: inglés  - 

Versión: 1.0

Estado: Final

Tipo:  application/pdf - 

Tipo de recurso: Text  - 

Tipo de Interactividad: Expositivo

Nivel de Interactividad: muy bajo

Audiencia: Estudiante  -  Profesor  -  Autor  - 

Estructura: Atomic

Coste: no

Copyright: sí

: Copyright 2005 A K Peters, Ltd.

Formatos:  application/pdf - 

Requerimientos técnicos:  Browser: Any - 

Relación: [References] 1542-7951
[References] 1944-9488

Fecha de contribución: 03-dic-2014

Contacto:

Localización:
* Internet Math. 2, no. 4 (2005), 525-534

Otros recursos del mismo autor(es)

  1. How Useful is Old Information? EXTENDED ABSTRACT We consider the problem of load balancing in dynamic distributed systems in cases where new incoming...
  2. The Power of Two Choices in Randomized Load Balancing The Power of Two Choices in Randomized Load Balancing by Michael David Mitzenmacher Doctor of Phi...
  3. A digital fountain approach to reliable distribution of bulk data The proliferation of applications that must reliably distribute bulk data to a large number of auton...
  4. On the Analysis of Randomized Load Balancing Schemes It is well known that simple randomized load balancing schemes can balance load effectively while in...
  5. Cuckoo hashing with pages Abstract. Although cuckoo hashing has significant applications in both theoretical and practical set...

Otros recursos de la mismacolección

  1. Approximations of the Generalized Inverse of the Graph Laplacian Matrix We devise methods for finding approximations of the generalized inverse of the graph Laplacian matri...
  2. Strategic Coloring of a Graph We study a strategic game in which every node of a graph is owned by a player who has to choose a co...
  3. Bistability through Triadic Closure We propose and analyze a class of evolving network models suitable for describing a dynamic topologi...
  4. Digraph Laplacian and the Degree of Asymmetry In this paper we extend and generalize the standard spectral graph theory (or random-walk theory) on...
  5. Balance in Random Signed Graphs By extending Heider's and Cartwright–Harary's theory of balance in deterministic social structures, ...

Aviso de cookies: Usamos cookies propias y de terceros para mejorar nuestros servicios, para análisis estadístico y para mostrarle publicidad. Si continua navegando consideramos que acepta su uso en los términos establecidos en la Política de cookies.