Browse Dept. of Computer Science by Title

  • 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
  • Liu, Si; Olveczky, Peter C.; Santhanam, Keshav; Wang, Qi; Gupta, Indranil; Meseguer, Jose (2018)
    Designers of distributed database systems face the choice between performance and consistency guarantees: with stronger consistency guarantees comes higher transactional latency and lower throughput. Certain collaborative ...

    application/pdf

    application/pdfPDF (822kB)
  • Kundu, Gourab; Chang, Ming-Wei; Roth, Dan; Zhai, ChengXiang (2013-11-14)

    application/pdf

    application/pdfPDF (224kB)
  • 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)
  • Yu, Jing; Baghsorkhi, Sara; Snir, Marc (2005-04)
    We propose in this paper a new approach to study the temporal and spatial locality of codes using a plot of cache miss bandwidth as a function of cache size and line size for a fully associative LRU cache. We apply this ...

    application/pdf

    application/pdfPDF (179kB)
  • 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-05)
    Physical design plays an important role in connecting front-end design and back-end design in chip development. In this thesis, we solve several important problems in physical design of VLSI circuits. Chapter 2 addresses ...

    application/pdf

    application/pdfPDF (2MB)
  • 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
  • Ko, Steven Y.; Morales, Ramses V.; Gupta, Indranil (2006-05)
    In this paper we argue that a worker-centric scheduler design is more desirable for data-intensive applications in Grid environments. Previous research on task-centric scheduling for dataintensive applications has identi ...

    application/pdf

    application/pdfPDF (173kB)
  • 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)
  • Mancuso, Renato (2017-04-19)
    Multi-core platforms represent the answer of the industry to the increasing demand for computational capabilities. In fact, multi-core platforms can deliver large computational power together with minimum costs, compact ...

    application/pdf

    application/pdfPDF (5MB)
  • 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
  • Xu, Zhe (2019-04-25)
    Stock market volatility is influenced by several factors including but not limited to information release, dissemination, and public acceptance. In terms of information, traders would read financial reports released by ...

    application/pdf

    application/pdfPDF (2MB)
  • 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