Relevant bibliographies by topics / Resource sharing

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Books
  4. Book chapters
  5. Conference papers
  6. Reports

Academic literature on the topic 'Resource sharing'

Author: Grafiati
Published: 4 June 2021
Last updated: 25 May 2024

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Resource sharing.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Resource sharing"

1

Motais de Narbonne, Anne-Marie. "Resource Sharing: Information Sharing." International Astronomical Union Colloquium 110 (1989): 198. http://dx.doi.org/10.1017/s0252921100003407.

Full text
Abstract:
When we speak of resource sharing, we mostly mean document sharing through union catalogues, list exchanges, interlibrary loans, cooperative acquisition programs... Yet, the first and primary condition of the library network efficiency is information sharing.Libraries have been quite successful in this field for the last decades but, nowadays, new technology such as electronic mail or telefax offers unequaled facilities to set up and promote a permanent and world wide program of information exchanges liable to meet the increasing needs of punctual responses. From an eight year experience at Paris Observatory library which has been hosting the French national service CADIST [Centre d’acquisition et d’information scientifique et technique], we can assert that, outer demands of informations being at the same time useful information sources, such a quick answer service does participate to the improvement of the inner service efficiency.
APA, Harvard, Vancouver, ISO, and other styles
2

Eaton, Nancy L. "Resource Sharing:." Journal of Library Administration 21, no. 1-2 (November 1995): 27–38. http://dx.doi.org/10.1300/j111v21n01_03.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Degkwitz, Andreas. "Resource Sharing:." Serials Librarian 29, no. 1-2 (June 1996): 205–17. http://dx.doi.org/10.1300/j123v29n01_12.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Baker, Barry B. "Resource Sharing." Technical Services Quarterly 16, no. 2 (December 4, 1998): 35–45. http://dx.doi.org/10.1300/j124v16n02_04.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Baker, Shirley K. "Resource Sharing." Technical Services Quarterly 16, no. 2 (December 4, 1998): 47–56. http://dx.doi.org/10.1300/j124v16n02_05.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Varma, P. C. V. "Resource sharing." IEEE Potentials 23, no. 5 (January 2005): 14–16. http://dx.doi.org/10.1109/mp.2005.1368911.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Kumbhar, Mrs Anuradha A. "Resource Sharing and Networking in Libraries." International Journal of Trend in Scientific Research and Development Special Issue, Special Issue-ICDEBI2018 (October 3, 2018): 224–27. http://dx.doi.org/10.31142/ijtsrd18709.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

St. Clair, Gloriana. "Editorial: Resource Sharing." College & Research Libraries 52, no. 2 (March 1, 1991): 115–16. http://dx.doi.org/10.5860/crl_52_02_115.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Wallhaus, Robert. "Library Resource Sharing." Resource Sharing & Information Networks 2, no. 3-4 (February 18, 1986): 11–19. http://dx.doi.org/10.1300/j121v02n03_04.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Dumont, Paul E. "Library Resource Sharing." Resource Sharing & Information Networks 16, no. 1 (January 2002): 133–44. http://dx.doi.org/10.1300/j121v16n01_10.

Full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Resource sharing"

1

Cheung, Sing Kwong. "Processor-sharing queues and resource sharing in wireless LANs." Enschede : University of Twente [Host], 2007. http://doc.utwente.nl/57875.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Reinertson, Susan K. "Resource sharing : building collaboration for regionalization." Thesis, Monterey, Calif. : Springfield, Va. : Naval Postgraduate School ; Available from National Technical Information Service, 2005. http://library.nps.navy.mil/uhtbin/hyperion/05Sep%5FReinertson.pdf.

Full text
Abstract:
Thesis (M.A. in Security Studies (Homeland Security and Defense))--Naval Postgraduate School, September 2005.
Thesis Advisor(s): Christopher Bellavita. Includes bibliographical references (p. 35-37). Also available online.
APA, Harvard, Vancouver, ISO, and other styles
3

Nishio, Takayuki. "Cooperative Resource Sharing toward Mobile Cloud." 京都大学 (Kyoto University), 2013. http://hdl.handle.net/2433/174850.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Hougardy, Evelyne. "Resource sharing in bark beetle parasitoids." Doctoral thesis, Universite Libre de Bruxelles, 2003. http://hdl.handle.net/2013/ULB-DIPOT:oai:dipot.ulb.ac.be:2013/211330.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Lin, Xiaohan. "A .net based resource sharing framework." Thesis, Massachusetts Institute of Technology, 2006. http://hdl.handle.net/1721.1/34611.

Full text
Abstract:
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Civil and Environmental Engineering, 2006.
Includes bibliographical references (p. 121-124).
This thesis presents an Internet resource sharing architecture. It allows users to access and utilize unused computer resources, such as CPU cycles and storage, without an expert's knowledge. It achieves this by providing a number of abstract services that hide some of the complexity inherent in distributed computing. In recent years, Grid Computing has been proposed as a solution for Internet resource sharing. However, Grid Computing as presently implemented does not address the need of the large majority of the users. In this thesis, we propose a different approach to achieve Internet resource sharing called the Realm. The Realm Framework offers a lightweight layer on top of the Microsoft .Net Framework so that the programs that can be migrated to .Net Framework can also utilize the shared resources through the Realm Framework. By leveraging the Microsoft .Net Framework, the Realm Framework avoids tedious re-working in this fast-paced world of technology by sitting on the top of the full-featured, coherent and up-to-date development platform. The Realm Framework applies current technologies such as Web Services, the Common Language Runtime (CLR) and popular encryption algorithms.
(cont.) In this thesis a versatile runtime system and a set of extension interfaces in C# programming language is developed. The modularized software package offers a layered programming model for distributed-application developers with different levels of proficiency. Two utilities that are helpful for maintaining a distributed system are also developed, namely, a dynamic domain-name based inter-realm communication scheme and a distributed debugger. Examples of applying the Realm Framework to several typical scenarios are shown, including embarrassingly parallel problems that require little communication between computing nodes, parallel computing problems that require intensive message-passing between the computing nodes, and universal storage systems that are based on storage media and the messenger-like applications that require a sophisticated communication scheme.
by Xiaohan Lin
Ph.D.
APA, Harvard, Vancouver, ISO, and other styles
6

Liu, Wei. "Cooperative Resource Sharing in Mobile Cloud Computing." 京都大学 (Kyoto University), 2015. http://hdl.handle.net/2433/199456.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Karlsson, Robert S. "Radio resource sharing in hierarchical cellular systems /." Stockholm, 2001. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-3200.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Rahimi, Mahya. "Formal approaches to multi-resource sharing scheduling." Thesis, Lyon, 2017. http://www.theses.fr/2017LYSEI129/document.

Full text
Abstract:
L'objectif principal de cette thèse est de proposer une approche efficace de modélisation et de résolution pour le problème d’ordonnancement, en mettant l’accent sur le partage multi-ressources et sur l’incertitude potentielle d’occurrence de certains événements. L'ordonnancement a pour objectif de réaliser un ensemble de tâches à la fois en respectant des contraintes prédéfinies et en optimisant le temps. Ce travail s’intéresse en particulier à la minimisation du temps total d’exécution. La plupart des approches existantes préconisent une modélisation mathématique exprimant des équations et des contraintes pour décrire et résoudre des problèmes d’ordonnancement. De telles démarches ont une complexité inhérente. Cependant dans l’industrie, la tâche de planification est récurrente et peut requérir des changements fréquents des contraintes. Outre cela, la prise en compte d’événements incertains est peu supportée par les approches existantes; cela peut toutefois augmenter la robustesse d’un ordonnancement. Pour répondre à ces problématiques, après une introduction, le chapitre 2 aborde le problème de l’ordonnancement à travers une démarche de modélisation visuelle, expressive et formelle, s’appuyant sur les automates pondérés et sur la théorie des automates temporisés. L’originalité des modèles proposés réside aussi dans leur capacité de décrire le partage de ressources multiples et proposer une approche de résolution efficace. Ces modèles ont l’avantage d’être directement exploitables par des outils de vérification formelle, à travers une démarche de preuve par contradiction vis-à-vis de l’existence d’une solution. Les résultats effectifs sont obtenus grâce à l’outil UPPAAL. La complexité inhérente à la production d’une solution optimale est abordée à travers un algorithme de recherche et d’amélioration itérative de solutions, offrant une complexité très prometteuse sur la classe de problèmes étudiés. Dans le chapitre 3, une composition synchrone est d’automates pondérés est proposée dans le but de résoudre le problème d’ordonnancement en effectuant une analyse d’atteignabilité optimale directement sur les modèles automates pondérés. Dans le quatrième chapitre, divers comportements incontrôlables tels que le temps de début, la durée de la tâche et l'occurrence d’échec dans un problème d‘ordonnancement sont modélisés par des automates de jeu temporisés. Ensuite, le problème est résolu en effectuant une synthèse de stratégie optimale dans le temps dans l'outil de synthèse TIGA
The objective of scheduling problems is to find the optimal performing sequence for a set of tasks by respecting predefined constraints and optimizing a cost: time, energy, etc. Despite classical approaches, automata models are expressive and also robust against changes in the parameter setting and against changes in the problem specification. Besides, few studies have used formal verification approaches for addressing scheduling problems; yet none of them considered challenging and practical issues such as multi-resource sharing aspect, uncontrollable environment and reaching the optimal schedule in a reasonable time for industrializing the model. The main objective of this thesis is to propose an efficient modeling and solving approach for the scheduling problem, considering multi-resource sharing and potential uncertainty in occurrence of certain events. For this purpose, after an introduction in Chapter 1, Chapter 2 addresses the problem of scheduling through a visual, expressive and formal modeling approach, based on weighted automata and the theory of timed automata. The originality of the proposed approach lies in ability of handling the sharing of multiple resources and proposing an efficient solving approach. The proposed models have the advantage of being directly exploitable by means of formal verification tools. The results are obtained using the UPPAAL tool. To solve the problem, an algorithm is developed based on iterating reachability analysis to obtain sub-optimal makespan. Results show the proposed model and solving approach provides a very promising complexity on the class of studied problems and can be applied to industrial cases. In Chapter 3, a synchronous composition of weighted automata is proposed to solve the scheduling problem by performing an optimal reachability analysis directly on the weighted automata models. In the fourth chapter, various uncontrollable behaviors such as the start time, the duration of the task and the failure occurrence in a scheduling problem are modeled by timed game automata. Then, the problem is solved by performing an optimal strategy synthesis over time in TIGA as a synthesis tool
APA, Harvard, Vancouver, ISO, and other styles
9

Leung, Philip, and Daniel Svensson. "SecuRES: Secure Resource Sharing System : AN INVESTIGATION INTO USE OF PUBLIC LEDGER TECHNOLOGY TO CREATE DECENTRALIZED DIGITAL RESOURCE-SHARING SYSTEMS." Thesis, KTH, Skolan för informations- och kommunikationsteknik (ICT), 2015. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-187348.

Full text
Abstract:
The project aims at solving the problem of non-repudiation, integrity and confidentiality of data when digitally exchanging sensitive resources between parties that need to be able to trust each other without the need for a trusted third party. This is done in the framework of answering to what extent digital resources can be shared securely in a decentralized public ledger-based system compared to trust-based alternatives. A background of existing resource sharing solutions is explored which shows an abundance third party trust-based systems, but also an interest in public ledger solutions in the form of the Storj network which uses such technology, but focuses on storage rather than sharing. The proposed solution, called SecuRES, is a communication protocol based on public ledger technology which acts similar to Bitcoin. A prototype based on the protocol has been implemented which proves the ability to share encrypted files with one or several recipients through a decentralized public ledger-based network. It was concluded that the SecuRES solution could do away with the requirement of trust in third parties for all but some optional operations using external authentication services. This is done while still maintaining data integrity of a similar or greater degree to trust-based solutions and offers the additional benefits of non-repudiation, high confidentiality and high transparency from the ability to make source code and protocol documentation openly available without endangering the system. Further research is needed to investigate whether the system can scale up for widespread adoption while maintaining security and reasonable performance requirements.
Projektet ämnar lösa problemen med oförnekbarhet, integritet och konfidentialitet när man delar känsligt data mellan parter som behöver lita på varandra utan inblanding av betrodd tredje part. Detta diskuteras för att besvara till vilken omfattning digitala resurser kan delas säkert i ett decentraliserat system baserat på publika liggare jämfört med existerande tillitsbaserade alternativ. En undersökning av nuvarande resursdelningslösningar visar att det existerar många tillitsbaserade system men även en växande andel lösningar baserade på publika liggare. En intressant lösning som lyfts fram är Storj som använder sådan teknologi men fokuserar på resurslagring mer är delning. Projektets föreslagna lösning, kallad SecuRES, är ett kommunikationsprotokoll baserat på en publik liggare likt Bitcoin. En prototyp baserad på protokollet har tagits fram som visar att det är möjligt att dela krypterade filer med en eller flera mottagare genom ett decentraliserat nätverk baserat på publika liggare. Slutsatsen som dras är att SecuRES klarar sig utan betrodda tredje parter för att dela resurser medan vissa operationer kan göras mer användarvänliga genom externa autentiseringstjänster. Själva lösningen garanterar integritet av data och medför ytterligare fördelar såsom oförnekbarhet, konfidentialitet och hög transparens då man kan göra källkoden och protocoldokumentation fritt läsbar utan att utsätta systemet för fara. Vidare forskning behövs för att undersöka om systemet kan skalas upp för allmän användning och alltjämt bibehålla säkerhets- samt prestandakrav.
APA, Harvard, Vancouver, ISO, and other styles
10

Nemati, Farhang. "Resource Sharing in Real-Time Systems on Multiprocessors." Doctoral thesis, Mälardalens högskola, Akademin för innovation, design och teknik, 2012. http://urn.kb.se/resolve?urn=urn:nbn:se:mdh:diva-14497.

Full text
Abstract:
In recent years multiprocessor architectures have become mainstream, and multi-core processors are found in products ranging from small portable cell phones to large computer servers. In parallel, research on real-time systems has mainly focused on traditional single-core processors. Hence, in order for real-time systems to fully leverage on the extra capacity offered by new multi-core processors, new design techniques, scheduling approaches, and real-time analysis methods have to be developed. In the multi-core and multiprocessor domain there are mainly two scheduling approaches, global and partitioned scheduling. Under global scheduling each task can execute on any processor at any time while under partitioned scheduling tasks are statically allocated to processors and migration of tasks among processors is not allowed. Besides simplicity and efficiency of partitioned scheduling protocols, existing scheduling and synchronization techniques developed for single-core processor platforms can more easily be extended to partitioned scheduling. This also simplifies migration of existing systems to multi-cores. An important issue related to partitioned scheduling is the distribution of tasks among the processors, which is a bin-packing problem. In this thesis we propose a blocking-aware partitioning heuristic algorithm to distribute tasks onto the processors of a multi-core architecture. The objective of the proposed algorithm is to decrease the blocking overhead of tasks, which reduces the total utilization and has the potential to reduce the number of required processors. In industrial embedded software systems, large and complex systems are usually divided into several components (applications) each of which is developed independently without knowledge of each other, and potentially in parallel. However, the applications may share mutually exclusive resources when they co-execute on a multi-core platform which introduce a challenge for the techniques needed to ensure predictability. In this thesis we have proposed a new synchronization protocol for handling mutually exclusive resources shared among real-time applications on a multi-core platform. The schedulability analysis of each application is performed in isolation and parallel and the requirements of each application with respect to the resources it may share are included in an interface. The protocol did not originally consider any priorities among the applications. We have proposed an additional version of the protocol which grants access to resources based on priorities assigned to the applications. We have also proposed an optimal priority assignment algorithm to assign unique priorities to the applications sharing resources. Our evaluations confirm that the protocol together with the priority assignment algorithm outperforms existing alternatives in most cases. In the proposed synchronization protocol each application is assumed to be allocated on one dedicated core. However, in this thesis we have further extended the synchronization protocol to be applicable for applications allocated on multiple dedicated cores of a multi-core platform. Furthermore, we have shown how to efficiently calculate the resource hold times of resources for applications. The resource hold time of a resource for an application is the maximum duration of time that the application may lock the resource whenever it requests the resource. Finally, the thesis discusses and proposes directions for future work.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "Resource sharing"

1

Churches, World Council of. Resource sharing book. Geneva: WCC Publications, 1997.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
2

Churches, World Council of. Resource sharing book. Geneva: WCC Publications, 1994.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
3

Churches, World Council of. Resource sharing book. Geneva: WCC Publications, 1995.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
4

Churches, World Council of. Resource sharing book. Geneva: WCC Publications, 1993.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
5

R, Hogan Donna, Dahlbach Barbara J, and Association of Research Libraries. Systems and Procedures Exchange Center., eds. Electronic resource sharing. Washington, DC: Association of Research Libraries, Office of Management Services, 1997.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
6

Library, Canada National. Resource sharing in Canada. Ottawa: National Library of Canada, 1990.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
7

Rao, P. Bhaskara. Information network & resource sharing. New Delhi: Reliance Pub. House, 1998.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
8

Boucher, Virginia. Library resource sharing in Colorado. Denver: Colorado State Library, 1988.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
9

Bakewell, K. G. B. Resource sharing: Practice and problems. Bradford: MCB University Press, 1990.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
10

D, Lunau Carrol, Dalhousie University. School of Library and Information Studies., and National Library of Canada, eds. Information resource sharing: Canadian perspectives. Halifax, N.S: Dalhousie University, School of Library and Information Studies, 1993.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Book chapters on the topic "Resource sharing"

1

Zhang, David, Xiaobo Li, and Zhiyong Liu. "Internet Resource Sharing." In Data Management and Internet Computing for Image/Pattern Analysis, 133–49. Boston, MA: Springer US, 2001. http://dx.doi.org/10.1007/978-1-4615-1527-2_8.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Topham, Douglas William. "Basic Resource Sharing." In A System V Guide to UNIX and XENIX, 593–606. New York, NY: Springer New York, 1990. http://dx.doi.org/10.1007/978-1-4612-3246-9_40.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Zhang, Yuming. "Resource Allocation for Sharing Economy." In Sharing Economics, 239–55. Singapore: Springer Singapore, 2021. http://dx.doi.org/10.1007/978-981-16-3649-3_14.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Horn, Jeffrey. "Resource-Based Fitness Sharing." In Parallel Problem Solving from Nature — PPSN VII, 381–90. Berlin, Heidelberg: Springer Berlin Heidelberg, 2002. http://dx.doi.org/10.1007/3-540-45712-7_37.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Zhao, Han, and Xiaolin Li. "Flexible Resource Sharing Management." In Resource Management in Utility and Cloud Computing, 57–77. New York, NY: Springer New York, 2013. http://dx.doi.org/10.1007/978-1-4614-8970-2_4.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Chandrakanth, M. G. "Economics of Sharing Irrigation Water." In Water Resource Economics, 205–8. New Delhi: Springer India, 2015. http://dx.doi.org/10.1007/978-81-322-2479-2_16.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Chandrakanth, M. G. "Water Markets for Sharing Limited Water." In Water Resource Economics, 149–72. New Delhi: Springer India, 2015. http://dx.doi.org/10.1007/978-81-322-2479-2_11.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Kruys, Jan, and Luke Qian. "Radio Resource Management." In Sharing RF Spectrum with Commodity Wireless Technologies, 199–216. Dordrecht: Springer Netherlands, 2011. http://dx.doi.org/10.1007/978-94-007-1585-1_10.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Barbosa, Valmir C. "The Combinatorics of Resource Sharing." In Applied Optimization, 27–52. Boston, MA: Springer US, 2002. http://dx.doi.org/10.1007/978-1-4757-3609-0_2.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Hansen, Hans Vatne, Vera Goebel, Thomas Plagemann, and Matti Siekkinen. "Resource Adaptive Distributed Information Sharing." In Lecture Notes in Computer Science, 246–55. Berlin, Heidelberg: Springer Berlin Heidelberg, 2010. http://dx.doi.org/10.1007/978-3-642-13971-0_24.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Resource sharing"

1

Raje and Bergamaschi. "Generalized resource sharing." In Proceedings of IEEE International Conference on Computer Aided Design (ICCAD). IEEE, 1997. http://dx.doi.org/10.1109/iccad.1997.643538.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

"Research on Library Information Resource Sharing Model Based on Resource Sharing." In 2020 5th International Conference on Technologies in Manufacturing, Information and Computing. Francis Academic Press, 2020. http://dx.doi.org/10.25236/ictmic.2020.097.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

"Session 7: resource sharing." In Proceedings. 13th IEEE International Symposium on High performance Distributed Computing, 2004. IEEE, 2004. http://dx.doi.org/10.1109/hpdc.2004.1323534.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Sandén, Bo. "Resource sharing deadlock prevention." In Tutorial proceedings. New York, New York, USA: ACM Press, 1995. http://dx.doi.org/10.1145/216591.216597.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

He, Linli, and Thomas R. Ioerger. "Forming resource-sharing coalitions." In the 2005 ACM symposium. New York, New York, USA: ACM Press, 2005. http://dx.doi.org/10.1145/1066677.1066700.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Kis, Dávid, Gergő Gombos, Sándor Laki, and Szilveszter Nádas. "Resource sharing beyond FQ." In SIGCOMM '22: ACM SIGCOMM 2022 Conference. New York, NY, USA: ACM, 2022. http://dx.doi.org/10.1145/3546037.3546045.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Coijanovic, Christoph, Daniel Schadt, Christiane Weis, and Thorsten Strufe. "BAZAAR: Anonymous Resource Sharing." In CCS '23: ACM SIGSAC Conference on Computer and Communications Security. New York, NY, USA: ACM, 2023. http://dx.doi.org/10.1145/3603216.3624957.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

CHEN, JIANGPING, and FEI LI. "RESOURCE AND RESOURCE SHARING IN INTELLIGENT INFORMATION ACCESS." In Proceedings of the 2008 International Conference. WORLD SCIENTIFIC, 2008. http://dx.doi.org/10.1142/9789812837578_0029.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Bringmann and Rosenstiel. "Resource sharing in hierarchical synthesis." In Proceedings of IEEE International Conference on Computer Aided Design (ICCAD). IEEE, 1997. http://dx.doi.org/10.1109/iccad.1997.643537.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Josipović, Lana, Axel Marmet, Andrea Guerrieri, and Paolo Ienne. "Resource Sharing in Dataflow Circuits." In FPGA '21: The 2021 ACM/SIGDA International Symposium on Field Programmable Gate Arrays. New York, NY, USA: ACM, 2021. http://dx.doi.org/10.1145/3431920.3439472.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Resource sharing"

1

Zhao, Tao, and Vijay Karamcheti. Expressing and Enforcing Distributed Resource Sharing Agreements. Fort Belvoir, VA: Defense Technical Information Center, January 2000. http://dx.doi.org/10.21236/ada440802.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Ahn, Gail-Joon. Assured Resource Sharing in Ad-Hoc Collaboration. Office of Scientific and Technical Information (OSTI), December 2015. http://dx.doi.org/10.2172/1240145.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Zhao, Tao, and Vijay Karamcheti. Enforcing Resource Sharing Agreements Among Distributed Server Clusters. Fort Belvoir, VA: Defense Technical Information Center, January 2001. http://dx.doi.org/10.21236/ada440591.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Haider, Steven, and Kathleen McGarry. Recent Trends in Resource Sharing Among the Poor. Cambridge, MA: National Bureau of Economic Research, September 2005. http://dx.doi.org/10.3386/w11612.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Back, Godmar, Wilson C. Hsieh, and Jay Lepreau. Processes in KaffeOS: Isolation, Resource Management, and Sharing in Java. Fort Belvoir, VA: Defense Technical Information Center, April 2000. http://dx.doi.org/10.21236/ada440101.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Kang, Shian C. Learning to Predict Demand in a Transport-Resource Sharing Task. Fort Belvoir, VA: Defense Technical Information Center, September 2015. http://dx.doi.org/10.21236/ad1009057.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Lee, Jaeho, and Edmund H. Durfee. A Microeconomic Approach to Intelligent Resource Sharing in Multiagent Systems. Fort Belvoir, VA: Defense Technical Information Center, January 1995. http://dx.doi.org/10.21236/ada462235.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Oli, K. P., and T. Dhakal. Access and Benefit Sharing from Genetic Resources and Associated Traditional Knowledge; Training for Trainers and Resource Manual. Kathmandu, Nepal: International Centre for Integrated Mountain Development (ICIMOD), 2009. http://dx.doi.org/10.53055/icimod.495.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

DEPARTMENT OF THE INTERIOR WASHINGTON DC. River Almanac. An Information Sharing Bulletin of the Long Term Resource Monitoring Program. Fort Belvoir, VA: Defense Technical Information Center, July 1997. http://dx.doi.org/10.21236/ada328923.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Zhang, X., Z. Ali, and P. Brzozowski. RSVP-TE Signaling Procedure for End-to-End GMPLS Restoration and Resource Sharing. Edited by H. Zheng and R. Gandhi. RFC Editor, March 2017. http://dx.doi.org/10.17487/rfc8131.

Full text
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Resource sharing' for particular source types:
Journal articles Dissertations / Theses Books
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography