Gotowe bibliografie tematyczne / Network planning

Spis treści

  1. Artykuły w czasopismach
  2. Rozprawy doktorskie
  3. Książki
  4. Części książek
  5. Streszczenia konferencji
  6. Raporty organizacyjne

Gotowa bibliografia na temat „Network planning”

Autor: Grafiati
Data publikacji: 4 czerwca 2021
Data aktualizacji: 9 marca 2023

Utwórz poprawne odniesienie w stylach APA, MLA, Chicago, Harvard i wielu innych

Wybierz rodzaj źródła:

Zobacz listy aktualnych artykułów, książek, rozpraw, streszczeń i innych źródeł naukowych na temat „Network planning”.

Przycisk „Dodaj do bibliografii” jest dostępny obok każdej pracy w bibliografii. Użyj go – a my automatycznie utworzymy odniesienie bibliograficzne do wybranej pracy w stylu cytowania, którego potrzebujesz: APA, MLA, Harvard, Chicago, Vancouver itp.

Możesz również pobrać pełny tekst publikacji naukowej w formacie „.pdf” i przeczytać adnotację do pracy online, jeśli odpowiednie parametry są dostępne w metadanych.

Artykuły w czasopismach na temat "Network planning"

1

Bollapragada, Ramesh, Thomas B. Morawski, Luz E. Pinzon, Steven H. Richman i Raymond Sackett. "Network Planning of Broadband Wireless Networks". Interfaces 37, nr 2 (kwiecień 2007): 143–62. http://dx.doi.org/10.1287/inte.1060.0284.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
2

PELLEGRINI, Lilla, Monica LEBA i Alexandru IOVANOVICI. "CHARACTERIZATION OF URBAN TRANSPORTATION NETWORKS USING NETWORK MOTIFS". Acta Electrotechnica et Informatica 20, nr 4 (21.01.2020): 3–9. http://dx.doi.org/10.15546/aeei-2020-0019.

Pełny tekst źródła
Streszczenie:
We use tools and techniques specific to the field of complex networks analysis for the identification and extraction of key parameters which define ”good” patterns and practices for designing public transportation networks. Using network motifs we analyze a set of 18 cities using public data sets regarding the topology of network and discuss each of the identified motifs using the concepts and tools of urban planning.
Style APA, Harvard, Vancouver, ISO itp.
3

Koutitas, George. "Green Network Planning of Single Frequency Networks". IEEE Transactions on Broadcasting 56, nr 4 (grudzień 2010): 541–50. http://dx.doi.org/10.1109/tbc.2010.2056252.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
4

Wombell, S. "Network capacity planning". IEE Review 45, nr 2 (1.03.1999): 79–80. http://dx.doi.org/10.1049/ir:19990211.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
5

Prof. Y. B. Gurav, Prof Y. B. Gurav, i Manjiri Deshmukh. "Query Planning of Continuous Aggregation Queries Over Network". Indian Journal of Applied Research 3, nr 5 (1.10.2011): 140–43. http://dx.doi.org/10.15373/2249555x/may2013/42.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
6

Lin, Shih-Chun, Pu Wang, Ian F. Akyildiz i Min Luo. "Towards Optimal Network Planning for Software-Defined Networks". IEEE Transactions on Mobile Computing 17, nr 12 (1.12.2018): 2953–67. http://dx.doi.org/10.1109/tmc.2018.2815691.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
7

Falconer, Warren E. "The Third International Network Planning Symposium, Networks '86". Computer Networks and ISDN Systems 12, nr 2 (styczeń 1986): 126–27. http://dx.doi.org/10.1016/0169-7552(86)90021-8.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
8

Chen, Chi-Yuan, Fan-Hsun Tseng, Chin-Feng Lai i Han-Chieh Chao. "Network planning for mobile multi-hop relay networks". Wireless Communications and Mobile Computing 15, nr 7 (10.07.2013): 1142–54. http://dx.doi.org/10.1002/wcm.2396.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
9

Quach, Hong-Nam, Hyeonjun Jo, Sungwoong Yeom i Kyungbaek Kim. "Link Stability aware Reinforcement Learning based Network Path Planning". Korean Institute of Smart Media 11, nr 5 (30.06.2022): 82–90. http://dx.doi.org/10.30693/smj.2022.11.5.82.

Pełny tekst źródła
Streszczenie:
Along with the growing popularity of 5G technology, providing flexible and personalized network services suitable for requirements of customers has also become a lucrative venture and business key for network service providers. Therefore, dynamic network provisioning is needed to help network service providers. Moreover, increasing user demand for network services meets specific requirements of users, including location, usage duration, and QoS. In this paper, a routing algorithm, which makes routing decisions using Reinforcement Learning (RL) based on the information about link stability, is proposed and called Link Stability aware Reinforcement Learning (LSRL) routing. To evaluate this algorithm, several mininet-based experiments with various network settings were conducted. As a result, it was observed that the proposed method accepts more requests through the evaluation than the past link annotated shorted path algorithm and it was demonstrated that the proposed approach is an appealing solution for dynamic network provisioning routing.
Style APA, Harvard, Vancouver, ISO itp.
10

Penchev, Georgi. "Planning and Implementing Change in Cyber Security Network Organisations". Information & Security: An International Journal 50 (2021): 89–101. http://dx.doi.org/10.11610/isij.5008.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
Więcej źródeł

Rozprawy doktorskie na temat "Network planning"

1

Malmgren, Göran. "Network Planning of Single Frequency Broadcasting Networks". Licentiate thesis, KTH, Signaler, sensorer och system, 1996. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-28559.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
2

Conner, Steven. "Automated distribution network planning with active network management". Thesis, University of Edinburgh, 2017. http://hdl.handle.net/1842/28818.

Pełny tekst źródła
Streszczenie:
Renewable energy generation is becoming a major part of energy supply, often in the form of distributed generation (DG) connected to distribution networks. While growth has been rapid, there is awareness that limitations on spare capacity within distribution (and transmission) networks is holding back development. Developments are being shelved until new network reinforcements can be built, which may make some projects non-viable. Reinforcements are costly and often underutilised, typically only loaded to their limits for a few occasions during the year. In order to accommodate new DG without the high costs or delays, active network management (ANM) is being promoted in which generation and other network assets are controlled within the limits of the existing network. There is a great deal of complexity and uncertainty associated with developing ANM and devising coherent plans to accommodate new DG is challenging for Distribution Network Operators (DNOs). As such, there is a need for robust network planning tools that can explicitly handle ANM and which can be trusted and implemented easily. This thesis describes the need for and the development of a new distribution expansion planning framework that provides DNOs with a better understanding of the impacts created by renewable DG and the value of ANM. This revolves around a heuristic planning framework which schedules necessary upgrades in power lines and transformers associated with changes in demand as well as those driven by the connection of DG. Within this framework a form of decentralised, adaptive control of DG output has been introduced to allow estimation of the impact of managing voltage and power flow constraints on the timing and need for network upgrades. The framework is initially deployed using simple scenarios but a further advance is the explicit use of time series to provide substantially improved estimates of the levels of curtailment implied by ANM. In addition, a simplified approach to incorporating demand side management has been deployed to facilitate understanding of the scope and role this may play in facilitating DG connections.
Style APA, Harvard, Vancouver, ISO itp.
3

Ligeti, Agnes. "Single frequency network planning". Doctoral thesis, KTH, Signals, Sensors and Systems, 1999. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-2857.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
4

LUZ, AIRTON LOBATO. "PLANNING OF A DISTRIBUITION NETWORK". PONTIFÍCIA UNIVERSIDADE CATÓLICA DO RIO DE JANEIRO, 1992. http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=8800@1.

Pełny tekst źródła
Streszczenie:
Este trabalho apresenta uma metodologia e correspondente programa computacional para o planejamento da expansão de uma rede distribuição que permite determinar, por exemplo, a localização de banco de capacitores e de reguladores de tensão e/ou auto-boosters, o ganho de tensão e redução de perdas elétricas com a troca de condutores. A metodologia proposta é baseada na solução do problema de fluxo de potência desenvolvido especificamente para a distribuição. O trabalho automatiza procedimentos rotineiros do planejamento dos sistemas de distribuição, aumentando sua eficiência na análise correta de alternativas, auxiliando o planejador na tomada de decisões para determinar a expansão dos sistemas de distribuição. Testes com sistema da COELBA são apresentados.
This work presentes a methodology and a digital computer program for the expansion planning of a distribuition network that allows to determine, for exemple, the location of capacitors bank and voltage regulators and/or automatic-boosters, voltage gain and redution of electrical losses with the changing of conductors. The proposed methodology is based on the solution of the power flow problem developd espcifically to distribution systems. The work automatizes common procedures for distribuition systems planing, increasing its efficiency in choosing correct alternatives, aidding the planer to make decisions to determine the distribution systems expansion. Several tests with COELBA system s are presented.
Style APA, Harvard, Vancouver, ISO itp.
5

Tarhini, Hussein Ali. "Network Models In Evacuation Planning". Diss., Virginia Tech, 2014. http://hdl.handle.net/10919/64359.

Pełny tekst źródła
Streszczenie:
This dissertation addresses the development and analysis of optimization models for evacuation planning. Specifically we consider the cases of large-scale regional evacuation using household vehicles and hospital evacuation. Since it is difficult to estimate the exact number of people evacuating, we first consider the case where the population size is uncertain. We review the methods studied in the literature, mainly the strategy of using a deterministic counterpart, i.e., a single deterministic parameter to represent the uncertain population, and we show that these methods are not very effective in generating a good traffic management strategy. We provide alternatives, where we describe some networks where an optimal policy exist independent of the demand realization and we propose some simple heuristics for more complex ones. Next we consider the traffic management tools that can be generated from an evacuation plan. We start by introducing the cell transmission model with flow reduction. This model captures the flow reduction after the onset of congestion. We then discuss the management tools that can be extracted from this model. We also propose some simplification to the model formulation to enhance its tractability. A heuristic for generating a solution is also proposed, and its solution quality is analyzed. Finally, we discuss the hospital evacuation problem where we develop an integer programming model that integrates the building evacuation with the transportation of patients. The impact of building evacuation capabilities on the transportation plan is investigated through the case of a large regional hospital case study. We also propose a decomposition scheme to improve the tractability of the integer program.
Ph. D.
Style APA, Harvard, Vancouver, ISO itp.
6

Vohnout, Sonia Isabel 1964. "Diverse routing in network planning". Thesis, The University of Arizona, 1990. http://hdl.handle.net/10150/291952.

Pełny tekst źródła
Streszczenie:
This thesis discusses an algorithm and two heuristics for solving a particular network optimization problem: The node-disjoint paths problem. The goal of this optimization problem is to find two node-disjoint paths between a given origin-destination pair whose total cost is minimum. This problem is shown to be NP-Hard. Two heuristics are investigated in this thesis. The sequential shortest paths heuristic, is the faster of the two methods, but the quality of the solution may be sacrificed. On the other hand, the simultaneous shortest paths heuristic, which yields very good solutions, has higher complexity. We also discuss an implicit enumeration algorithm that is used to verify the quality of the solution obtained from the heuristics.
Style APA, Harvard, Vancouver, ISO itp.
7

Margraf, Jeffrey A. "Decision support for network connectivity planning". Thesis, Monterey, Calif. : Springfield, Va. : Naval Postgraduate School ; Available from National Technical Information Service, 1996. http://handle.dtic.mil/100.2/ADA319588.

Pełny tekst źródła
Streszczenie:
Thesis (M.S. in Information Technology Management) Naval Postgraduate School, September 1996.
Thesis advisor(s): S. Sridhar, H.K. Bhargava. "September 1996." Includes bibliographical references (p. 125). Also available online.
Style APA, Harvard, Vancouver, ISO itp.
8

Barlow, Philip R. "Planning considerations for secure network protocols/". Thesis, Monterey, Calif. : Springfield, Va. : Naval Postgraduate School ; Available from National Technical Information Service, 1999. http://handle.dtic.mil/100.2/ADA361958.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
9

Morales, Alcaide Fernando. "Towards cognitive in-operation network planning". Doctoral thesis, Universitat Politècnica de Catalunya, 2018. http://hdl.handle.net/10803/620635.

Pełny tekst źródła
Streszczenie:
Next-generation internet services such as live TV and video on demand require high bandwidth and ultra-low latency. The ever-increasing volume, dynamicity and stringent requirements of these services’ demands are generating new challenges to nowadays telecom networks. To decrease expenses, service-layer content providers are delivering their content near the end users, thus allowing a low latency and tailored content delivery. As a consequence of this, unseen metro and even core traffic dynamicity is arising with changes in the volume and direction of the traffic along the day. A tremendous effort to efficiently manage networks is currently ongoing towards the realisation of 5G networks. This translates in looking for network architectures supporting dynamic resource allocation, fulfilling strict service requirements and minimising the total cost of ownership (TCO). In this regard, in-operation network planning was recently proven to successfully support various network reconfiguration use cases in prospective scenarios. Nevertheless, additional research to extend in-operation planning capabilities from typical reactive optimization schemes to proactive and predictive schemes based on the analysis of network monitoring data is required. A hot topic raising increasing attention is cognitive networking, where an elevated knowledge about the network could be obtained as a result of introducing data analytics in the telecom operator’s infrastructure. By using predictive knowledge about the network traffic, in-operation network planning mechanisms could be enhanced to efficiently adapt the network by means of future traffic prediction, thus achieving cognitive in-operation network planning. In this thesis, we focus on studying mechanisms to enable cognitive in-operation network planning in core networks. In particular, we focus on dynamically reconfiguring virtual network topologies (VNT) at the MPLS layer, covering a number of detailed objectives. First, we start studying mechanisms to allow network traffic flow modelling, from monitoring and data transformation to the estimation of predictive traffic model based on this data. By means of these traffic models, then we tackle a cognitive approach to periodically adapt the core VNT to current and future traffic, using predicted traffic matrices based on origin-destination (OD) predictive models. This optimization approach, named VENTURE, is efficiently solved using dedicated heuristic algorithms and its feasibility is demonstrated in an experimental in-operation network planning environment. Finally, we extend VENTURE to consider core flows dynamicity as a result of metro flows re-routing, which represents a meaningful dynamic traffic scenario. This extension, which entails enhancements to coordinate metro and core network controllers with the aim of allowing fast adaption of core OD traffic models, is evaluated and validated in terms of traffic models accuracy and experimental feasibility.
Els serveis d’internet de nova generació tals com la televisió en viu o el vídeo sota demanda requereixen d’un gran ample de banda i d’ultra-baixa latència. L’increment continu del volum, dinamicitat i requeriments d’aquests serveis està generant nous reptes pels teleoperadors de xarxa. Per reduir costs, els proveïdors de contingut estan disposant aquests més a prop dels usuaris finals, aconseguint així una entrega de contingut feta a mida. Conseqüentment, estem presenciant una dinamicitat mai vista en el tràfic de xarxes de metro amb canvis en la direcció i el volum del tràfic al llarg del dia. Actualment, s’està duent a terme un gran esforç cap a la realització de xarxes 5G. Aquest esforç es tradueix en cercar noves arquitectures de xarxa que suportin l’assignació dinàmica de recursos, complint requeriments de servei estrictes i minimitzant el cost total de la propietat. En aquest sentit, recentment s’ha demostrat com l’aplicació de “in-operation network planning” permet exitosament suportar diversos casos d’ús de reconfiguració de xarxa en escenaris prospectius. No obstant, és necessari dur a terme més recerca per tal d’estendre “in-operation network planning” des d’un esquema reactiu d’optimització cap a un nou esquema proactiu basat en l’analítica de dades provinents del monitoritzat de la xarxa. El concepte de xarxes cognitives es també troba al centre d’atenció, on un elevat coneixement de la xarxa s’obtindria com a resultat d’introduir analítica de dades en la infraestructura del teleoperador. Mitjançant un coneixement predictiu sobre el tràfic de xarxa, els mecanismes de in-operation network planning es podrien millorar per adaptar la xarxa eficientment basant-se en predicció de tràfic, assolint així el que anomenem com a “cognitive in-operation network Planning”. En aquesta tesi ens centrem en l’estudi de mecanismes que permetin establir “el cognitive in-operation network Planning” en xarxes de core. En particular, ens centrem en reconfigurar dinàmicament topologies de xarxa virtual (VNT) a la capa MPLS, cobrint una sèrie d’objectius detallats. Primer comencem estudiant mecanismes pel modelat de fluxos de tràfic de xarxa, des del seu monitoritzat i transformació fins a l’estimació de models predictius de tràfic. Posteriorment, i mitjançant aquests models predictius, tractem un esquema cognitiu per adaptar periòdicament la VNT utilitzant matrius de tràfic basades en predicció de parells origen-destí (OD). Aquesta optimització, anomenada VENTURE, és resolta eficientment fent servir heurístiques dedicades i és posteriorment avaluada sota escenaris de tràfic de xarxa dinàmics. A continuació, estenem VENTURE considerant la dinamicitat dels fluxos de tràfic de xarxes de metro, el qual representa un escenari rellevant de dinamicitat de tràfic. Aquesta extensió involucra millores per coordinar els operadors de metro i core amb l’objectiu d’aconseguir una ràpida adaptació de models de tràfic OD. Finalment, proposem dues arquitectures de xarxa necessàries per aplicar els mecanismes anteriors en entorns experimentals, emprant protocols estat-de-l’art com són OpenFlow i IPFIX. La metodologia emprada per avaluar el treball anterior consisteix en una primera avaluació numèrica fent servir un simulador de xarxes íntegrament dissenyat i desenvolupat per a aquesta tesi. Després d’aquesta validació basada en simulació, la factibilitat experimental de les arquitectures de xarxa proposades és avaluada en un entorn de proves distribuït.
Style APA, Harvard, Vancouver, ISO itp.
10

Alam, Md Ariful. "Mobile Network Planning and KPI Improvement". Thesis, Linnéuniversitetet, Institutionen för fysik och elektroteknik (IFE), 2013. http://urn.kb.se/resolve?urn=urn:nbn:se:lnu:diva-25762.

Pełny tekst źródła
Streszczenie:
In this project, coverage planning in GSM networks as well as capacity and frequency planning has been studied. Various signal interruptions and the necessary steps to remove those interruptions in order to maintain signal quality in mobile communication have been studied. Precautions that should be taken for reducing the effects of interruptions have also been discussed. A drive test has been performed as a part of the improvement process. Guidelines for key performance indicators (KPI) pave the way for radio network quality, coverage and the smooth functioning of the GSM system.
Style APA, Harvard, Vancouver, ISO itp.
Więcej źródeł

Książki na temat "Network planning"

1

1966-, Bijlsma Like, red. Netwerk-steden-bouw =: Network urbanism. Nijmegen: SUN, 2000.

Znajdź pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
2

Sansò, Brunilde, i Patrick Soriano, red. Telecommunications Network Planning. Boston, MA: Springer US, 1999. http://dx.doi.org/10.1007/978-1-4615-5087-7.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
3

1960-, Sansó Brunilde, i Soriano Patrick, red. Telecommunications network planning. Boston: Kluwer Academic, 1999.

Znajdź pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
4

Shahnia, Farhad, Ali Arefi i Gerard Ledwich, red. Electric Distribution Network Planning. Singapore: Springer Singapore, 2018. http://dx.doi.org/10.1007/978-981-10-7056-3.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
5

Jeroen, Van Schaick, Klaasen, I. T. (Ina T.) i Technische Universiteit Delft. Faculteit der Bouwkunde, red. Urban networks: Network urbanism. Amsterdam, The Netherlands: Techne Press, 2008.

Znajdź pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
6

Network optimization. London: Chapman & Hall, 1995.

Znajdź pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
7

1954-, Pardalos P. M., Hearn D. W i Hager William W. 1948-, red. Network optimization. Berlin: Springer, 1997.

Znajdź pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
8

Abdelghany, Ahmed, i Khaled Abdelghany. Airline Network Planning and Scheduling. Hoboken, NJ, USA: John Wiley & Sons, Inc., 2018. http://dx.doi.org/10.1002/9781119275909.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
9

Simmons, Jane M. Optical Network Design and Planning. Cham: Springer International Publishing, 2014. http://dx.doi.org/10.1007/978-3-319-05227-4.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
10

ATM network planning and implementation. Boston: International Thomson Computer Press, 1997.

Znajdź pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
Więcej źródeł

Części książek na temat "Network planning"

1

Ganesan, Ramnath. "Network Planning". W The Profitable Supply Chain, 193–214. Berkeley, CA: Apress, 2014. http://dx.doi.org/10.1007/978-1-4842-0526-6_6.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
2

Krishnamurthy, Trichy Venkataraman, i Rajaneesh Shetty. "Network Planning". W 4G: Deployment Strategies and Operational Implications, 1–36. Berkeley, CA: Apress, 2014. http://dx.doi.org/10.1007/978-1-4302-6326-5_1.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
3

Olsen, Brian, Pablo Tapia, Jussi Reunanen i Harri Holma. "Network Planning". W HSPA+ Evolution to Release 12, 213–51. Chichester, UK: John Wiley & Sons, Ltd, 2014. http://dx.doi.org/10.1002/9781118693728.ch11.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
4

Weik, Martin H. "network planning". W Computer Science and Communications Dictionary, 1089. Boston, MA: Springer US, 2000. http://dx.doi.org/10.1007/1-4020-0613-6_12263.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
5

Simchi-Levi, David, Xin Chen i Julien Bramel. "Network Planning". W The Logic of Logistics, 379–402. New York, NY: Springer New York, 2013. http://dx.doi.org/10.1007/978-1-4614-9149-1_20.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
6

Herroelen, Willy S., i Graham K. Rand. "Network Planning". W Encyclopedia of Operations Research and Management Science, 1032–37. Boston, MA: Springer US, 2013. http://dx.doi.org/10.1007/978-1-4419-1153-7_665.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
7

White, Peter. "Network planning". W Public Transport, 131–57. Edition 6. | New York : Routledge, 2016. | Series: The natural and built environment series | Revised edition of the author’s Public transport, 2009.: Routledge, 2016. http://dx.doi.org/10.4324/9781315675770-7.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
8

de Alencar, Marcelo Sampaio, i Djalma de Melo Carvalho Filho. "Cell Planning". W Cellular Network Planning, 83–106. New York: River Publishers, 2022. http://dx.doi.org/10.1201/9781003337478-3.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
9

Stadtler, Hartmut. "Master Planning - Supply Network Planning". W Advanced Planning in Supply Chains, 109–48. Berlin, Heidelberg: Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-24215-1_6.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
10

Kasilingam, Raja G. "Logistics network planning". W Logistics and Transportation, 47–56. Boston, MA: Springer US, 1998. http://dx.doi.org/10.1007/978-1-4615-5277-2_3.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.

Streszczenia konferencji na temat "Network planning"

1

Barreto, Priscila Solis, i Paulo H. P. de Carvalho. "Network Planning Optimization for Multimedia Networks". W 2008 7th IEEE International Symposium on Network Computing and Applications (NCA). IEEE, 2008. http://dx.doi.org/10.1109/nca.2008.30.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
2

Lin, Yuan-Hao. "MAN network planning". W Asia-Pacific Optical and Wireless Communications Conference and Exhibit, redaktorzy Xiaomin Ren i Tomonori Aoyama. SPIE, 2001. http://dx.doi.org/10.1117/12.445146.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
3

Eichenser, B. J. "Planning the network". W IEE Colloquium on Making Life Easier - Network Design and Management Tools. IEE, 1996. http://dx.doi.org/10.1049/ic:19961155.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
4

Marianovskyi, Vilatii, Daryna Feshchenko i Maksym Lytovka. "Wireless Network Planning". W 2022 IEEE 4th International Conference on Advanced Trends in Information Theory (ATIT). IEEE, 2022. http://dx.doi.org/10.1109/atit58178.2022.10024183.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
5

Jaumard, Brigitte, Hamed Pouya, Rami Fahim i Andres Barrios. "Planning network migration". W ICC 2016 - 2016 IEEE International Conference on Communications. IEEE, 2016. http://dx.doi.org/10.1109/icc.2016.7511244.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
6

Pacharintanakul, Peera, i David Tipper. "Differentiated crosslayer network mapping in multilayered network architectures". W 2010 14th International Telecommunications Network Strategy and Planning Symposium (NETWORKS). IEEE, 2010. http://dx.doi.org/10.1109/netwks.2010.5624908.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
7

Doherty, Deirdre H., Thomas B. Morawski, Raymond A. Sackett, Benjamin Y. C. Tang, Carlos Urrutia-Valdes i Z. John Zhao. "Next generation networks multiservice network design". W 2008 13th International Telecommunications Network Strategy and Planning Symposium (NETWORKS). IEEE, 2008. http://dx.doi.org/10.1109/netwks.2008.6231315.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
8

Zhao, Rong, Liwei Zhou i Carmen Mas Machuca. "Dynamic migration planning towards FTTH". W 2010 14th International Telecommunications Network Strategy and Planning Symposium (NETWORKS). IEEE, 2010. http://dx.doi.org/10.1109/netwks.2010.5624904.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
9

Schupke, Dominic A., i Clara Kronberger. "Multiperiod planning for optical networks". W 2010 14th International Telecommunications Network Strategy and Planning Symposium (NETWORKS). IEEE, 2010. http://dx.doi.org/10.1109/netwks.2010.5624957.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
10

Jarry-Lacombe, Bernard. "Network global strategy". W 2008 13th International Telecommunications Network Strategy and Planning Symposium (NETWORKS). IEEE, 2008. http://dx.doi.org/10.1109/netwks.2008.6231382.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.

Raporty organizacyjne na temat "Network planning"

1

Shannon, Anahma. Bering Strait Energy Planning Network. Office of Scientific and Technical Information (OSTI), wrzesień 2022. http://dx.doi.org/10.2172/1885467.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
2

Shivashankar, Vikas, Ugur Kuter i Dana S. Nau. Hierarchical Goal Network Planning: Initial Results. Fort Belvoir, VA: Defense Technical Information Center, maj 2011. http://dx.doi.org/10.21236/ada560015.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
3

Peterson, B. E. Description of the National Highway Planning Network. Office of Scientific and Technical Information (OSTI), wrzesień 1990. http://dx.doi.org/10.2172/10138180.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
4

Robinson, David J. Characterization and Planning for Computer Network Operations. Fort Belvoir, VA: Defense Technical Information Center, lipiec 2010. http://dx.doi.org/10.21236/ada577860.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
5

Malik, Sharad. Augmenting SAT Solvers for Network Configuration/Planning. Fort Belvoir, VA: Defense Technical Information Center, listopad 2006. http://dx.doi.org/10.21236/ada459907.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
6

Peterson, B. E. Description of the National Highway Planning Network. Office of Scientific and Technical Information (OSTI), wrzesień 1990. http://dx.doi.org/10.2172/5441186.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
7

Pearl, Judea. Dynamic Network Techniques for Autonomous Planning and Control. Fort Belvoir, VA: Defense Technical Information Center, listopad 2000. http://dx.doi.org/10.21236/ada387551.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
8

Munoz-Avila, Hector. Transfer Learning and Hierarchical Task Network Representations and Planning. Fort Belvoir, VA: Defense Technical Information Center, luty 2008. http://dx.doi.org/10.21236/ada500020.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
9

Sanders, William R., i Christopher V. Fultz. Collaborative Planning in Network-Enabled Co-Located and Distributed Environments. Fort Belvoir, VA: Defense Technical Information Center, marzec 2008. http://dx.doi.org/10.21236/ada479789.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
10

Baldin, Ilya, Shu Huang i Rajesh Gopidi. A Framework for Supporting Survivability, Network Planning and Cross-Layer Optimization in Future Multi-Domain Terabit Networks. Office of Scientific and Technical Information (OSTI), styczeń 2015. http://dx.doi.org/10.2172/1168750.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
Możesz być także zainteresowany rozszerzonymi bibliografiami na temat „Network planning” dla poszczególnych typów źródeł:
Artykuły w czasopismach Rozprawy doktorskie Książki
Oferujemy zniżki na wszystkie plany premium dla autorów, których prace zostały uwzględnione w tematycznych zestawieniach literatury. Skontaktuj się z nami, aby uzyskać unikalny kod promocyjny!

Do bibliografii