Genetic algorithm

Decent Essays
Improved Essays
Superior Essays
Great Essays
Brilliant Essays
    Page 7 of 50 - About 500 Essays
  • Improved Essays

    Although I consider myself technologically savvy, pursuing my degree in computer science will provide me with the core principles of computer systems and enhance my knowledge of programming languages, dimensional modeling programs, data structures and algorithms. My background in customer service has really helped to mold my interpersonal skills, which is needed in this field to be able to build and maintain relationships with internal and external departments throughout the company. I look…

    • 775 Words
    • 4 Pages
    Improved Essays
  • Superior Essays

    technology does. I believe in the vision illustrated in Jeremy Rifkin 's book “The Zero Marginal Cost Society” that the emerging technology infrastructure – the Internet of Things (IoT) – will connect everyone and everything, use Big Data, analytics and algorithms to increase productivity and efficiency, and lower the marginal cost of producing and sharing to near zero. I feel excited to contribute to this great age of evolution. There are two fields in which I am particularly interested and…

    • 1030 Words
    • 4 Pages
    Superior Essays
  • Improved Essays

    1) Linked Cluster Algorithm (LCA) [5], [6], [7]: LCA, was one of the initial clustering algorithms evolved. It was primarily developed for wired sensors, but later applied in wireless sensor networks. In LCA, a unique ID number is allotted to each node and has two means of becoming a cluster head. The first way is that if the node has the greatest ID number in the set including all neighbor nodes and the node itself. The second way is to assume that none of its neighbors are cluster heads,…

    • 930 Words
    • 4 Pages
    Improved Essays
  • Great Essays

    Determinsitic, P, NP, NPC Reductions, Reducibility, Reductions, certificate, complexity I. INTRODUCTION What is P vs NP? Why it is important to know what problems are in P and what problems are in NP? Some problems like Addition, Subtraction, sorting and algorithms such as Dijkstra’s are all belong to the category of P. The problems that are solved in polynomial time. But there are problems…

    • 1404 Words
    • 6 Pages
    Great Essays
  • Superior Essays

    Data, information, knowledge and wisdom are referred to as the DIKW hierarchy model cited in Figure 1. This visual metaphor illustrates large amounts of data at the bottom of the pyramid which are reduced to smaller amounts of information consequently creating more condensed knowledge and even smaller wisdom. For Ackoff (1989) data is a symbol and does not have meaning on its own. Information emerges from data that has been processed and hence data has now been given meaning. Knowledge is built…

    • 1422 Words
    • 6 Pages
    Superior Essays
  • Great Essays

    our daily lives, from our phones to our gaming systems to even our watches. Where ever you go there is a computer, even in traffic lights. But makes computers so special in our lives, well they help us communicate with people, they help us solve algorithms, they help us make money, they are used in education and many more interesting things. Without computers in the world, most of the things happening everyday would stop. Most people know what computers are and how they work, but there is a…

    • 1171 Words
    • 5 Pages
    Great Essays
  • Great Essays

    One thing that mathematics and movies have in common is that they are incredibly interesting. However, when you put two great things together, there are potential discrepancies that make the experience a little disappointing if you look deeper into it. There have been some brilliant films about famous mathematicians who have changed the way we look at mathematics for the better. Unfortunately, movies, in general, tend to have a reputation for moving things around and fixing the information so…

    • 2193 Words
    • 9 Pages
    Great Essays
  • Great Essays

    instruction unlike its predecessors, solving the problem of inputting the program every time before using it. Z3 could also convert decimals to binaries and back again. It was later on proven to be Turing complete, which means that given the; appropriate algorithms, necessary time and memory, it could solve the same problems that the Turing machine could. It was also the first digital computer since it predates the ABC by one year (O 'Regan). Z3 was very similar to the modern day computers that…

    • 1350 Words
    • 6 Pages
    Great Essays
  • Improved Essays

    machine languages. And therefore, when I had the chance to select my major before the university, I chose Computer Science without any doubt or hesitation. During my undergraduate study at Iowa University, what I learn most are basic languages and algorithms, but some of the advanced courses and self-learning make me feel that computer science demonstrate the essence of natural science - evolution. For example, the development of website from static to dynamic, the progress of the sense…

    • 734 Words
    • 3 Pages
    Improved Essays
  • Improved Essays

    International Olympiad of Informatics to represent India, there was no doubt that I wanted to build things faster and more efficient than before. However, until then I did not know the booming field called machine learning. I always tried to make algorithms to predict something based on heuristic decisions or even just hardcoded bunch of decisions. It was only in UCSD when I took my first Machine learning course, I realized the true potential of Machines and Data and the sweet bond between…

    • 706 Words
    • 3 Pages
    Improved Essays
  • Page 1 4 5 6 7 8 9 10 11 50