# Browse Dept. of Computer Science by Title

• (2012-05-03)
This paper investigates open source applications to seek for oppor- tunities of flow-based parallelization. Domain of streaming appli- cation are targeted such as sentence parsing, image processing and data packet ...

application/pdf

PDF (225Kb)
• (2004-08)
Multicast is an important communication paradigm, also a problem well known for its difficulty (NP-completeness) to achieve certain optimization goals, such as minimum network delay. Recent advances in network coding\cit ...

application/pdf

PDF (271Kb)
• (2004-04)
Existing retrieval models all attempt to optimize one single utility function, which is often based on the topical relevance of a document with respect to a query. In real applications, retrieval involves more complex ...

application/pdf

PDF (161Kb)
• (2007-05)
We investigate the problem of maximizing network capacity sustained by IEEE 802.11 DCF in multi-hop wireless networks. By explicitly incorporating two key system parameters . carrier sense threshold and transmit power . ...

application/pdf

PDF (330Kb)
• (2010-05)
In this work, we propose an approach to optimal control based on the A* algorithm. It employs a discrete approximation of the dynamic of the robot to estimate the cost-to-go function using the wavefront propagation algorithm. ...

application/pdf

PDF (1Mb)
• (2004-12)
The shared-medium multi-hop nature of wireless ad hoc networks poses fundamental challenges to the design of effective resource allocation algorithms that are optimal with respect to resource utilization and fair across ...

application/pdf

PDF (853Kb)
• (1995)
In this dissertation, we solve the finite state machine (FSM) state assignment problem using an implementation of a genetic local search algorithm (GLS) that selectively targets design goals with the use of flexible cost ...

application/pdf

PDF (4Mb)
• (1993)
A triangulation in the plane is a maximal connected plane graph with straight edges. It is thus a plane graph whose bounded faces are triangles. For a fixed set of vertices, there are, in general, exponentially many ways ...

application/pdf

PDF (6Mb)
• (1986)
Network partitioning is a serious threat to the availability of replicated data in distributed database systems. To provide high data availability during partitioning, an optimistic strategy for transaction processing will ...

application/pdf

PDF (5Mb)
• (1990)
Unregulated concurrency in functional programs may lead to space demands that exceed available space, causing deadlock. This thesis proposes regulating concurrency optimistically with rollbacks. Excessive concurrency is ...

application/pdf

PDF (7Mb)
• (1984)
Reduction in linewidths in VLSI MOS has a positive effect on the cost/performance of the technology. It both decreases the circuit delays and increases the functionality available on-chip and, as such, gives MOS the potential ...

application/pdf

PDF (4Mb)
• (2013-02-03)
It is well-known that global optimization of a nonconvex function, in general, is computationally intractable. Nevertheless, many objective functions that we need to optimize may be nonconvex. In practice, when working ...

application/pdf

PDF (13Mb)
• (2015-01-21)
Runtime specialization optimizes programs based on partial information available only at run time. It is applicable when some input data is used repeatedly while other input data varies. This technique has the potential ...

application/pdf

PDF (836Kb)
• (2005-09)
As the speed of microprocessors increases according to Moore's law, access speeds of the main memory and disks lag far behind. As a result, disk accesses and memory accesses pose significant performance bottlenecks for a ...

application/pdf

PDF (1Mb)
• (2013-08-22)
The fast Fourier transform (FFT) is of intense interest to the scientific community. Its utility in a vast range of parallel scientific simulations warrants investigating its efficiency on a leading class of supercomputers ...

application/pdf

PDF (2Mb)
• (1996)
High level programming language features have long been seen as improving programmer efficiency at some cost in program efficiency. When features such as object-orientation and fine-grained concurrency, which greatly ...

application/pdf

PDF (11Mb)
• (2004-05)
One natural, yet unusual, source of data is the set of queries that are performed on a database. We consider such queries to be reflective of data access patterns and we use them to create indices on the data that are ...

application/pdf

PDF (928Kb)
• (2007-07)
Multimedia services such video-on-demand service to large number of clients require stable network bandwidth provision and short network delay. In order to achieve these goals, the object replication in overlay P2P networks ...

application/pdf

PDF (649Kb)
• (2004-05)
Distributed run-time code generation is a useful technique that can easily be implemented using the technique known as compositional semantics.'' In this dissertation, we describe a new system, Jumbo, which adds run-time ...

application/pdf

PDF (889Kb)
• (2006-06)
Java PathFinder (JPF) is an explicit-state model checker for Java programs. It explores all executions that a given program can have due to different thread interleavings and nondeterministic choices. JPF implements a ...

application/pdf

PDF (176Kb)