Browse Dissertations and Theses - Computer Science by Title

  • Cheng, Ray Franklin (1984)
    Referencing remote entities by names rather than by addresses is desirable in computer network or a joint-network. In this thesis, the naming and addressing problems in the internetwork environment are studied. Four naming ...

    application/pdf

    application/pdfPDF (6MB)Restricted to U of Illinois
  • Hodosh, Micah A (2015-11-25)
    Automatically describing an image with a concise natural language description is an ambitious and emerging task bringing together the Natural Language and Computer Vision communities. With any emerging task, the necessary ...

    application/pdf

    application/pdfPDF (34MB)
  • Horn, Jeffrey (1997)
    We extend the above analysis by looking at some aspects of the general case of multiple overlapping niches. We discover that calculating the equilibrium point for three or more niches under resource sharing can be ...

    application/pdf

    application/pdfPDF (13MB)Restricted to U of Illinois
  • Taylor, Kamilah J. (2011-01-14)
    This thesis introduces a sensor-based planning algorithm that uses less sensing information than any others within the family of bug algorithms. The robot is unable to access precise information regarding position ...

    application/pdf

    application/pdfPDF (8MB)
  • Ailavajhala, Megha (2015-12-03)
    This paper proposes a navigation system on an android platform, Navigator, designed for the visually impaired for easy and independent travel. People with physical disabilities have a tough time going from one place to ...

    application/pdf

    application/pdfPDF (5MB)
  • Kim, Junguk Lawrence (1987)
    Data replication in distributed database systems is designed to achieve high reliability and availability. In case of network partitioning, the mutual consistency of data may become doubtful unless the transaction processing ...

    application/pdf

    application/pdfPDF (4MB)Restricted to U of Illinois
  • Qian, Minglun (2005)
    When using a constrained formulation along with violation guided backpropagation to neural network learning for near noiseless time-series benchmarks, we achieve much improved prediction performance as compared to that of ...

    application/pdf

    application/pdfPDF (9MB)Restricted to U of Illinois
  • Harris, Harlan D. (2003)
    Another significant goal of this work was to identify the inductive biases of each algorithm, so that they can be fairlycompared with each other. By examining their biases and properties using the results presented here, ...

    application/pdf

    application/pdfPDF (5MB)Restricted to U of Illinois
  • application/pdf

    application/pdfPDF (4MB)Restricted to U of Illinois
  • Jiau, Hewijin (1998)
    In our framework, as include a DBMS so that we can take advantage of the database management, like transaction control facilities, multilevel transaction manager and log manager to help the design. The log manager can save ...

    application/pdf

    application/pdfPDF (4MB)Restricted to U of Illinois
  • application/pdf

    application/pdfPDF (4MB)Restricted to U of Illinois
  • Duque, Thyago (2015-01-21)
    Gene regulation is the process by which specific sets of genes are expressed in precise spatial/temporal patterns (Davidson 2010). It is a fundamental process with impact on development and cell identity (Fisher 2002; ...

    application/pdf

    application/pdfPDF (6MB)
  • Morrison, David (2014-09-16)
    Branch-and-bound (B&B) algorithms, and extensions such as branch-and-price (B&P) are powerful tools for optimization. These algorithms are used in a wide variety of settings, and thus it is beneficial to develop new ...

    application/pdf

    application/pdfPDF (960kB)
  • Chang, Cheng (1996)
    Engineering software systems, like CAD and CASE, are popular and important for today's industry. As applications of engineering software systems are getting more complex, engineering database systems, like CAD and CASE ...

    application/pdf

    application/pdfPDF (4MB)Restricted to U of Illinois
  • Lang, Anthony (2014-05-30)
    This thesis describes the design, development, and resulting curriculum materials of a new introductory course in digital forensics. This course is part of a new certificate program in digital forensics at the University ...

    application/pdf

    application/pdfPDF (966kB)
  • Xiang, Hua (2004)
    Chapters 6 and 7 address ECO problems. Chapter 6 presents two algorithms to resolve overlaps between power rails and signal wires which are introduced by power rail redesign. In chapter 7, we propose an algorithm to eliminate ...

    application/pdf

    application/pdfPDF (8MB)Restricted to U of Illinois
  • Zou, Jing (2012-09-18)
    News can influent the market. It has been proven that using text mining techniques, financial news can be used to predict market trend and volatility. In this thesis, we study some existing prediction algorithms that are ...

    application/pdf

    application/pdfPDF (208kB)
  • Mahfoud, Samir W. (1995)
    Niching methods extend genetic algorithms to domains that require the location and maintenance of multiple solutions. Such domains include classification and machine learning, multimodal function optimization, multiobjective ...

    application/pdf

    application/pdfPDF (13MB)Restricted to U of Illinois
  • Vakilian, Ali (2013-08-22)
    We consider node-weighted network design problems, in particular the survivable network design problem SNDP and its prize-collecting version PC-SNDP. The input consists of a node-weighted undirected graph $G=(V,E)$ ...

    application/pdf

    application/pdfPDF (614kB)
  • Miller, Brad L. (1997)
    As genetic algorithms (GA) move into industry, a thorough understanding of how GAs are affected by noise is becoming increasingly important. Noise affects a GA's population sizing requirements, performance characteristics, ...

    application/pdf

    application/pdfPDF (4MB)Restricted to U of Illinois