Consider a rooted directed acyclic graph G = (V, E) with root r, representing a collection V of web pages connected via a set E of hyperlinks. Each node v is associated with the pr...
In formal language theory, many families of languages are defined using grammars or finite acceptors like pushdown automata and Turing machines. For instance, context-sensitive l...
Abstract. This paper describes our experiences in defining the processes associated with preparing and administrating chemotherapy and then using those process definitions as the b...
Stefan Christov, Bin Chen, George S. Avrunin, Lori...
Christopher James Langmead⋆ and Sumit Kumar Jha Department of Computer Science, Carnegie Mellon University We present a novel approach for predicting protein folding kinetics us...
Peer-to-peer networks are one of the trends in the field of internetworking. Mobile agent-based technology is a newly proposed technology that can be used in peer-to-peer network...