# Browse Dissertations and Theses - Computer Science by Title

• (1988)
In order for a program to interact with the world as well as people do, we must provide it with a great deal of commonsense about the way things work. Reasoning about the geometric interactions and motions of objects is ...

application/pdf

PDF (6Mb)
• (1993)
Understanding people's commonsense knowledge about physical world is a fundamental problem in building intelligent systems. If this knowledge can be represented and used by computers, they can duplicate people's ability ...

application/pdf

PDF (7Mb)
• (1984)
Traditional studies on mechanism diagnoses have been based on the "single failure" assumption even though multiple failures are main concerns in the real world. In this research, we concentrate on a subclass of ...

application/pdf

PDF (5Mb)
• (1984)
A finite difference approximation to the semiconductor device equations using the Bernoulli function approximation to the exponential function is described, and the robustness of this approximation is demonstrated. Sheikh's ...

application/pdf

PDF (2Mb)
• (1980)
This report develops a new algorithm for computing the Cartesian product and join of large relations which attempts to take maximum advantage of available main-memory buffer space.

application/pdf

PDF (5Mb)
• (2011-05-25)
Nowadays, many complex text search systems, such as Entity Search or Topic Search, have been proposed to allow users to retrieve fine granularity units (e.g., entities or topics) inside documents directly. As those search ...

application/pdf

PDF (368Kb)
• (1994)
In a client-server architecture, replicated copies of an object are assigned to different servers (possibly client sites) in order to increase the availability of the database in case some but not all servers fail. The aim ...

application/pdf

PDF (5Mb)
• (1980)

application/pdf

PDF (4Mb)
• (2012-09-18)
The extensive form game is a formalism used to model environments where agents make sequences of decisions, possibly in the face of uncertainty about the state of the world and the decisions made by other agents. Such ...

application/pdf

PDF (702Kb)
• (1992)
Belief revision semantics appear promising as a definition for the meaning of updates to logical knowledge bases. Numerous model-based belief revision semantics have been proposed in the literature in recent years. It is ...

application/pdf

PDF (6Mb)
• (2011-05-25)
In multi-agent systems, the knowledge of agents about other agents’ knowledge often plays a pivotal role in their decisions. In many applications, this knowledge involves uncertainty. This uncertainty may be about the ...

application/pdf

PDF (2Mb)
• (2011-05-25)
As we move to large manycores, the hardware-based global checkpointing schemes that have been proposed for small shared-memory machines do not scale. Scalability barriers include global operations, work lost to global ...

application/pdf

PDF (284Kb)
• (2012-06-27)
In this thesis I introduce visual phrases, complex visual composites like a person riding a horse''. Visual phrases often display significantly reduced visual complexity compared to their component objects, because the ...

application/pdf

PDF (12Mb)
• (2011-05-25)
The growing availability and popularity of opinion rich resources on the online web resources, such as review sites and personal blogs, has made it convenient to find out about the opinions and experiences of layman people. ...

application/pdf

PDF (722Kb)
• (1993)
Advances in VLSI (Very Large Scale Integration) allow increasingly larger and more complex systems to be fabricated on a single chip or wafer. As the number of elements in these systems increases, the problem of tolerating ...

application/pdf

PDF (6Mb)
• (2015-01-21)
Record and deterministic Replay (RnR) is a primitive with many proposed applications in computer systems, including debugging, security and fault tolerance. RnR is typically a two phase process: in the first phase (record) ...

application/pdf

PDF (3Mb)
• (1987)
A perspective view of a slanted textured surface shows systematic changes in the density, area and aspect-ratio of texture elements. These apparent changes in texture element properties can be analyzed to recover information ...

application/pdf

PDF (9Mb)
• (1975)

application/pdf

PDF (4Mb)
• (1989)
Prefetching items into cache can either increase or decrease memory access time, depending on how well the prefetching algorithm matches the memory reference pattern. A popular prefetching algorithm is one block lookahead ...

application/pdf

PDF (5Mb)
• (1992)
Memory access time is a key factor limiting the performance of large-scale, shared-memory multiprocessors. In such systems, limited bandwidth in the interconnection between the processors and the memories, coupled with ...

application/pdf

PDF (5Mb)