A Model of Placing Liaisons in the Two Levels of an Organization Structure of a Complete Binary Tree Minimizing Total Path Length
None
Guardado en:
| Autor principal: | |
|---|---|
| Formato: | Capítulo de libro |
| Lenguaje: | inglés |
| Publicado: |
IntechOpen
2009
|
| Materias: | |
| Acceso en línea: | https://www.intechopen.com/chapters/8569 |
| Etiquetas: |
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
Ejemplares similares: A Model of Placing Liaisons in the Two Levels of an Organization Structure of a Complete Binary Tree Minimizing Total Path Length
- A Model of Adding Relations in Two Levels of a Linking Pin Organization Structure with Two Subordinates
- The algebra of binary trees is affine complete
- Approximation Theory of Total Variation Minimization for Data Completion
- Total Completion Time Minimization for Scheduling with Incompatibility Cliques
- Dangerous Liaisons of Convex Learning and Non-Affine Aggregation
- The Role of Fracture Liaison Services in Re-Fracture Prevention