Advanced search options

Advanced Search Options 🞨

Browse by author name (“Author name starts with…”).

Find ETDs with:

in
/  
in
/  
in
/  
in

Written in Published in Earliest date Latest date

Sorted by

Results per page:

Sorted by: relevance · author · university · dateNew search

Degree: MSin Computer Science

You searched for subject:(Inova o em servi os). Showing records 1 – 10 of 10 total matches.

Search Limiters

Last 2 Years | English Only

No search limiters apply to these results.

▼ Search Limiters


University of Nevada – Las Vegas

1. Piniganti, Hema. Self-stabilizing leader election in dynamic networks.

Degree: MSin Computer Science, Computer Science, 2010, University of Nevada – Las Vegas

  The leader election problem is one of the fundamental problems in distributed computing. It has applications in almost every domain. In dynamic networks, topology… (more)

Subjects/Keywords: Computer Sciences; Digital Communications and Networking; OS and Networks

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Piniganti, H. (2010). Self-stabilizing leader election in dynamic networks. (Masters Thesis). University of Nevada – Las Vegas. Retrieved from https://digitalscholarship.unlv.edu/thesesdissertations/680

Chicago Manual of Style (16th Edition):

Piniganti, Hema. “Self-stabilizing leader election in dynamic networks.” 2010. Masters Thesis, University of Nevada – Las Vegas. Accessed August 18, 2019. https://digitalscholarship.unlv.edu/thesesdissertations/680.

MLA Handbook (7th Edition):

Piniganti, Hema. “Self-stabilizing leader election in dynamic networks.” 2010. Web. 18 Aug 2019.

Vancouver:

Piniganti H. Self-stabilizing leader election in dynamic networks. [Internet] [Masters thesis]. University of Nevada – Las Vegas; 2010. [cited 2019 Aug 18]. Available from: https://digitalscholarship.unlv.edu/thesesdissertations/680.

Council of Science Editors:

Piniganti H. Self-stabilizing leader election in dynamic networks. [Masters Thesis]. University of Nevada – Las Vegas; 2010. Available from: https://digitalscholarship.unlv.edu/thesesdissertations/680


University of Nevada – Las Vegas

2. Andemeskel, Feven Z. Dynamic distributed programming and applications to swap edge problem.

Degree: MSin Computer Science, Computer Science, 2010, University of Nevada – Las Vegas

  Link failure is a common reason for disruption in communication networks. If communication between processes of a weighted distributed network is maintained by a… (more)

Subjects/Keywords: Computer and Systems Architecture; Computer Sciences; Digital Communications and Networking; OS and Networks

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Andemeskel, F. Z. (2010). Dynamic distributed programming and applications to swap edge problem. (Masters Thesis). University of Nevada – Las Vegas. Retrieved from https://digitalscholarship.unlv.edu/thesesdissertations/677

Chicago Manual of Style (16th Edition):

Andemeskel, Feven Z. “Dynamic distributed programming and applications to swap edge problem.” 2010. Masters Thesis, University of Nevada – Las Vegas. Accessed August 18, 2019. https://digitalscholarship.unlv.edu/thesesdissertations/677.

MLA Handbook (7th Edition):

Andemeskel, Feven Z. “Dynamic distributed programming and applications to swap edge problem.” 2010. Web. 18 Aug 2019.

Vancouver:

Andemeskel FZ. Dynamic distributed programming and applications to swap edge problem. [Internet] [Masters thesis]. University of Nevada – Las Vegas; 2010. [cited 2019 Aug 18]. Available from: https://digitalscholarship.unlv.edu/thesesdissertations/677.

Council of Science Editors:

Andemeskel FZ. Dynamic distributed programming and applications to swap edge problem. [Masters Thesis]. University of Nevada – Las Vegas; 2010. Available from: https://digitalscholarship.unlv.edu/thesesdissertations/677


University of Nevada – Las Vegas

3. Slomka, Mikolaj M. Visual Occam: High level visualization and design of process networks.

Degree: MSin Computer Science, 2010, University of Nevada – Las Vegas

  With networks, multiprocessors, and multi-threaded systems becoming more common in our world it is increasingly evident that concurrent programming is not something to be… (more)

Subjects/Keywords: Computer Sciences; Graphics and Human Computer Interfaces; OS and Networks; Programming Languages and Compilers; Software Engineering

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Slomka, M. M. (2010). Visual Occam: High level visualization and design of process networks. (Masters Thesis). University of Nevada – Las Vegas. Retrieved from https://digitalscholarship.unlv.edu/thesesdissertations/875

Chicago Manual of Style (16th Edition):

Slomka, Mikolaj M. “Visual Occam: High level visualization and design of process networks.” 2010. Masters Thesis, University of Nevada – Las Vegas. Accessed August 18, 2019. https://digitalscholarship.unlv.edu/thesesdissertations/875.

MLA Handbook (7th Edition):

Slomka, Mikolaj M. “Visual Occam: High level visualization and design of process networks.” 2010. Web. 18 Aug 2019.

Vancouver:

Slomka MM. Visual Occam: High level visualization and design of process networks. [Internet] [Masters thesis]. University of Nevada – Las Vegas; 2010. [cited 2019 Aug 18]. Available from: https://digitalscholarship.unlv.edu/thesesdissertations/875.

Council of Science Editors:

Slomka MM. Visual Occam: High level visualization and design of process networks. [Masters Thesis]. University of Nevada – Las Vegas; 2010. Available from: https://digitalscholarship.unlv.edu/thesesdissertations/875

4. Bang, Lucas Adam. An Online Algorithm for the 2-Server Problem On The Line with Improved Competitiveness.

Degree: MSin Computer Science, Computer Science, 2013, University of Nevada – Las Vegas

  In this thesis we present a randomized online algorithm for the 2-server problem on the line, named R-LINE (for Randomized Line). This algorithm achieves… (more)

Subjects/Keywords: Computer Sciences; Digital Communications and Networking; OS and Networks

…every output O ∈ F (I) we associate a positive real number C(I, O) which… …defines the cost of the output O on input I. Definition 2 An algorithm ALG for optimization… …all inputs I, OP T (I) = min C(I, O). O∈F (I) Traditional… …comparisons. Using randomization, quicksort makes O(n log n) comparisons on average. We… …k). It is conjectured that there is an O(log k) competitive algorithm for… 

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Bang, L. A. (2013). An Online Algorithm for the 2-Server Problem On The Line with Improved Competitiveness. (Masters Thesis). University of Nevada – Las Vegas. Retrieved from https://digitalscholarship.unlv.edu/thesesdissertations/1801

Chicago Manual of Style (16th Edition):

Bang, Lucas Adam. “An Online Algorithm for the 2-Server Problem On The Line with Improved Competitiveness.” 2013. Masters Thesis, University of Nevada – Las Vegas. Accessed August 18, 2019. https://digitalscholarship.unlv.edu/thesesdissertations/1801.

MLA Handbook (7th Edition):

Bang, Lucas Adam. “An Online Algorithm for the 2-Server Problem On The Line with Improved Competitiveness.” 2013. Web. 18 Aug 2019.

Vancouver:

Bang LA. An Online Algorithm for the 2-Server Problem On The Line with Improved Competitiveness. [Internet] [Masters thesis]. University of Nevada – Las Vegas; 2013. [cited 2019 Aug 18]. Available from: https://digitalscholarship.unlv.edu/thesesdissertations/1801.

Council of Science Editors:

Bang LA. An Online Algorithm for the 2-Server Problem On The Line with Improved Competitiveness. [Masters Thesis]. University of Nevada – Las Vegas; 2013. Available from: https://digitalscholarship.unlv.edu/thesesdissertations/1801

5. Maddula, Sabaresh Nageswara Rao. Message Passing Algorithm for Different Problems Sum, Mean, Guide and Sorting in a Rooted Tree Network.

Degree: MSin Computer Science, Computer Science, 2012, University of Nevada – Las Vegas

  In this thesis, we give message passing algorithms in distributed environment for five different problems of a rooted tree having n nodes. In the… (more)

Subjects/Keywords: Computer Sciences; OS and Networks; Theory and Algorithms

…the correct value of pV(P) within O(diam) rounds, provided the values… 

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Maddula, S. N. R. (2012). Message Passing Algorithm for Different Problems Sum, Mean, Guide and Sorting in a Rooted Tree Network. (Masters Thesis). University of Nevada – Las Vegas. Retrieved from https://digitalscholarship.unlv.edu/thesesdissertations/1683

Chicago Manual of Style (16th Edition):

Maddula, Sabaresh Nageswara Rao. “Message Passing Algorithm for Different Problems Sum, Mean, Guide and Sorting in a Rooted Tree Network.” 2012. Masters Thesis, University of Nevada – Las Vegas. Accessed August 18, 2019. https://digitalscholarship.unlv.edu/thesesdissertations/1683.

MLA Handbook (7th Edition):

Maddula, Sabaresh Nageswara Rao. “Message Passing Algorithm for Different Problems Sum, Mean, Guide and Sorting in a Rooted Tree Network.” 2012. Web. 18 Aug 2019.

Vancouver:

Maddula SNR. Message Passing Algorithm for Different Problems Sum, Mean, Guide and Sorting in a Rooted Tree Network. [Internet] [Masters thesis]. University of Nevada – Las Vegas; 2012. [cited 2019 Aug 18]. Available from: https://digitalscholarship.unlv.edu/thesesdissertations/1683.

Council of Science Editors:

Maddula SNR. Message Passing Algorithm for Different Problems Sum, Mean, Guide and Sorting in a Rooted Tree Network. [Masters Thesis]. University of Nevada – Las Vegas; 2012. Available from: https://digitalscholarship.unlv.edu/thesesdissertations/1683


California State University – San Bernardino

6. Muharish, Essa Yahya M. PACKET FILTER APPROACH TO DETECT DENIAL OF SERVICE ATTACKS.

Degree: MSin Computer Science, School of Computer Science and Engineering, 2016, California State University – San Bernardino

  Denial of service attacks (DoS) are a common threat to many online services. These attacks aim to overcome the availability of an online service… (more)

Subjects/Keywords: Denial-of-service (DoS). Internet Control Message Protocol (ICMP). User Datagram Protocol (UDP). Open Systems Interconnection Layers Attacks (OSI). Self-Organize-Map (SOM). Multilayer perceptron (MLP).; Information Security; OS and Networks; Systems Architecture; Theory and Algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Muharish, E. Y. M. (2016). PACKET FILTER APPROACH TO DETECT DENIAL OF SERVICE ATTACKS. (Thesis). California State University – San Bernardino. Retrieved from http://scholarworks.lib.csusb.edu/etd/342

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Muharish, Essa Yahya M. “PACKET FILTER APPROACH TO DETECT DENIAL OF SERVICE ATTACKS.” 2016. Thesis, California State University – San Bernardino. Accessed August 18, 2019. http://scholarworks.lib.csusb.edu/etd/342.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Muharish, Essa Yahya M. “PACKET FILTER APPROACH TO DETECT DENIAL OF SERVICE ATTACKS.” 2016. Web. 18 Aug 2019.

Vancouver:

Muharish EYM. PACKET FILTER APPROACH TO DETECT DENIAL OF SERVICE ATTACKS. [Internet] [Thesis]. California State University – San Bernardino; 2016. [cited 2019 Aug 18]. Available from: http://scholarworks.lib.csusb.edu/etd/342.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Muharish EYM. PACKET FILTER APPROACH TO DETECT DENIAL OF SERVICE ATTACKS. [Thesis]. California State University – San Bernardino; 2016. Available from: http://scholarworks.lib.csusb.edu/etd/342

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


California State University – San Bernardino

7. Chang, Ting-Shiuan. Mobile used car prices and information.

Degree: MSin Computer Science, School of Computer Science and Engineering, 2003, California State University – San Bernardino

 Wireless is getting more important and popular because its convenience and portability make things easier. The goal of this project is to develop a mobile… (more)

Subjects/Keywords: Palm OS; Automobiles  – Prices  – Computer assisted; Wireless communication systems; PalmPilot (Computer); Pocket computers; World Wide Web; Pricing  – Computer programs; Computer Engineering

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Chang, T. (2003). Mobile used car prices and information. (Thesis). California State University – San Bernardino. Retrieved from http://scholarworks.lib.csusb.edu/etd-project/2187

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Chang, Ting-Shiuan. “Mobile used car prices and information.” 2003. Thesis, California State University – San Bernardino. Accessed August 18, 2019. http://scholarworks.lib.csusb.edu/etd-project/2187.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Chang, Ting-Shiuan. “Mobile used car prices and information.” 2003. Web. 18 Aug 2019.

Vancouver:

Chang T. Mobile used car prices and information. [Internet] [Thesis]. California State University – San Bernardino; 2003. [cited 2019 Aug 18]. Available from: http://scholarworks.lib.csusb.edu/etd-project/2187.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Chang T. Mobile used car prices and information. [Thesis]. California State University – San Bernardino; 2003. Available from: http://scholarworks.lib.csusb.edu/etd-project/2187

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


California State University – San Bernardino

8. Solorio, Rigoberto. A WEB-BASED TEMPERATURE MONITORING SYSTEM FOR THE COLLEGE OF ARTS AND LETTERS.

Degree: MSin Computer Science, School of Computer Science and Engineering, 2015, California State University – San Bernardino

  In general, server rooms have restricted access requiring that staff possess access codes, keys, etc. Normally, only administrators are provided access to protect the… (more)

Subjects/Keywords: Temperature Sensor; Arduino Uno Temperature Sensor Project; Server Room Temperature; CSUSB Master Project; PHP and MySQL Temperature Sensor Project; Computer Science Master Project; Computer Science and Engineering Master Project; Temperature Measurement; Databases and Information Systems; Environmental Indicators and Impact Assessment; Environmental Monitoring; Information Security; OS and Networks; Other Computer Sciences; Software Engineering; Systems Architecture; Water Resource Management

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Solorio, R. (2015). A WEB-BASED TEMPERATURE MONITORING SYSTEM FOR THE COLLEGE OF ARTS AND LETTERS. (Thesis). California State University – San Bernardino. Retrieved from http://scholarworks.lib.csusb.edu/etd/129

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Solorio, Rigoberto. “A WEB-BASED TEMPERATURE MONITORING SYSTEM FOR THE COLLEGE OF ARTS AND LETTERS.” 2015. Thesis, California State University – San Bernardino. Accessed August 18, 2019. http://scholarworks.lib.csusb.edu/etd/129.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Solorio, Rigoberto. “A WEB-BASED TEMPERATURE MONITORING SYSTEM FOR THE COLLEGE OF ARTS AND LETTERS.” 2015. Web. 18 Aug 2019.

Vancouver:

Solorio R. A WEB-BASED TEMPERATURE MONITORING SYSTEM FOR THE COLLEGE OF ARTS AND LETTERS. [Internet] [Thesis]. California State University – San Bernardino; 2015. [cited 2019 Aug 18]. Available from: http://scholarworks.lib.csusb.edu/etd/129.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Solorio R. A WEB-BASED TEMPERATURE MONITORING SYSTEM FOR THE COLLEGE OF ARTS AND LETTERS. [Thesis]. California State University – San Bernardino; 2015. Available from: http://scholarworks.lib.csusb.edu/etd/129

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


California State University – San Bernardino

9. Braginton, Pauline. Taxonomy of synchronization and barrier as a basic mechanism for building other synchronization from it.

Degree: MSin Computer Science, School of Computer Science and Engineering, 2003, California State University – San Bernardino

A Distributed Shared Memory(DSM) system consists of several computers that share a memory area and has no global clock. Therefore, an ordering of events in the system is necessary. Synchronization is a mechanism for coordinating activities between processes, which are program instantiations in a system.

Subjects/Keywords: Distributed operating systems (Computers); Computers  – Access control; Algorithms  – Data processing; Data structures (Computer science); Time-sharing computer systems; Numerical taxonomy; Synchronous data transmission systems; OS and Networks

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Braginton, P. (2003). Taxonomy of synchronization and barrier as a basic mechanism for building other synchronization from it. (Thesis). California State University – San Bernardino. Retrieved from http://scholarworks.lib.csusb.edu/etd-project/2231

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Braginton, Pauline. “Taxonomy of synchronization and barrier as a basic mechanism for building other synchronization from it.” 2003. Thesis, California State University – San Bernardino. Accessed August 18, 2019. http://scholarworks.lib.csusb.edu/etd-project/2231.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Braginton, Pauline. “Taxonomy of synchronization and barrier as a basic mechanism for building other synchronization from it.” 2003. Web. 18 Aug 2019.

Vancouver:

Braginton P. Taxonomy of synchronization and barrier as a basic mechanism for building other synchronization from it. [Internet] [Thesis]. California State University – San Bernardino; 2003. [cited 2019 Aug 18]. Available from: http://scholarworks.lib.csusb.edu/etd-project/2231.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Braginton P. Taxonomy of synchronization and barrier as a basic mechanism for building other synchronization from it. [Thesis]. California State University – San Bernardino; 2003. Available from: http://scholarworks.lib.csusb.edu/etd-project/2231

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


California State University – San Bernardino

10. Braginton, Pauline. Taxonomy of synchronization and barrier as a basic mechanism for building other synchronization from it.

Degree: MSin Computer Science, School of Computer Science and Engineering, 2003, California State University – San Bernardino

A Distributed Shared Memory(DSM) system consists of several computers that share a memory area and has no global clock. Therefore, an ordering of events in the system is necessary. Synchronization is a mechanism for coordinating activities between processes, which are program instantiations in a system.

Subjects/Keywords: Distributed operating systems (Computers); Computers  – Access control; Algorithms  – Data processing; Data structures (Computer science); Time-sharing computer systems; Numerical taxonomy; Synchronous data transmission systems; OS and Networks

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Braginton, P. (2003). Taxonomy of synchronization and barrier as a basic mechanism for building other synchronization from it. (Thesis). California State University – San Bernardino. Retrieved from http://scholarworks.lib.csusb.edu/etd-project/2288

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Braginton, Pauline. “Taxonomy of synchronization and barrier as a basic mechanism for building other synchronization from it.” 2003. Thesis, California State University – San Bernardino. Accessed August 18, 2019. http://scholarworks.lib.csusb.edu/etd-project/2288.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Braginton, Pauline. “Taxonomy of synchronization and barrier as a basic mechanism for building other synchronization from it.” 2003. Web. 18 Aug 2019.

Vancouver:

Braginton P. Taxonomy of synchronization and barrier as a basic mechanism for building other synchronization from it. [Internet] [Thesis]. California State University – San Bernardino; 2003. [cited 2019 Aug 18]. Available from: http://scholarworks.lib.csusb.edu/etd-project/2288.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Braginton P. Taxonomy of synchronization and barrier as a basic mechanism for building other synchronization from it. [Thesis]. California State University – San Bernardino; 2003. Available from: http://scholarworks.lib.csusb.edu/etd-project/2288

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

.