• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Advanced Search Include Citations

Tools

Sorted by:
Try your query at:
Semantic Scholar Scholar Academic
Google Bing DBLP
Results 1 - 10 of 46
Next 10 →

Probabilistic Roadmaps for Path Planning in High-Dimensional Configuration Spaces

by Lydia Kavraki, Petr Svestka, Jean-claude Latombe, Mark Overmars - IEEE INTERNATIONAL CONFERENCE ON ROBOTICS AND AUTOMATION , 1996
"... A new motion planning method for robots in static workspaces is presented. This method proceeds in two phases: a learning phase and a query phase. In the learning phase, a probabilistic roadmap is constructed and stored as a graph whose nodes correspond to collision-free configurations and whose edg ..."
Abstract - Cited by 1277 (120 self) - Add to MetaCart
be done in a fraction of a second on a contemporary workstation (=150 MIPS), after learning for relatively short periods of time (a few dozen seconds)

Lightweight remote procedure call

by Brian N. Bershad, Thomas E. Anderson, Edward D. Lazowska, Henry M. Levy - ACM Transactions on Computer Systems , 1990
"... Lightweight Remote Procedure Call (LRPC) is a communication facility designed and optimized for communication between protection domains on the same machine. In contemporary small-kernel operating systems, existing RPC systems incur an unnecessarily high cost when used for the type of communication ..."
Abstract - Cited by 292 (26 self) - Add to MetaCart
Lightweight Remote Procedure Call (LRPC) is a communication facility designed and optimized for communication between protection domains on the same machine. In contemporary small-kernel operating systems, existing RPC systems incur an unnecessarily high cost when used for the type of communication

A performance comparison of contemporary DRAM architectures

by Bruce Jacob, Brian Davis, Trevor Mudge - In Proceedings of the 26th Annual International Symposium on Computer Architecture , 1999
"... In response to the growing gap between memory access time and processor speed, DRAM manufacturers have created several new DRAM architectures. This paper presents a simulation-based performance study of a representative group, each evaluated in a small system organization. These small-system organiz ..."
Abstract - Cited by 116 (11 self) - Add to MetaCart
-system organizations correspond to workstation-class computers and use on the order of 10 DRAM

Monitoring Utilization in an NT Workstation Lab

by Paul Kranenburg Erasmus, Paul Kranenburg
"... This paper describes a set of tools used to monitor and maintain NT workstations at the faculty of Economics at the Erasmus University Rotterdam. These tools have been employed in different shapes and on a variety of systems since 1992. In particular, the data gathered on usage patterns of workstati ..."
Abstract - Add to MetaCart
This paper describes a set of tools used to monitor and maintain NT workstations at the faculty of Economics at the Erasmus University Rotterdam. These tools have been employed in different shapes and on a variety of systems since 1992. In particular, the data gathered on usage patterns

Bandwidth Optimal All-reduce Algorithms for Clusters of Workstations

by unknown authors
"... We consider an efficient realization of the all-reduce operation with large data sizes in cluster environments, under the assumption that the reduce operator is associative and commutative. We derive a tight lower bound of the amount of data that must be communicated in order to complete this operat ..."
Abstract - Add to MetaCart
all contemporary clusters including SMP/multi-core clusters and Ethernet switched clusters with multiple switches. We demonstrate that the proposed algorithm is more efficient than other algorithms on clusters with different nodal architectures and networking technologies when the data size

Efficient Clustering Of Very Large Document Collections

by Inderjit S. Dhillon, James Fan, Yuqiang Guan , 2001
"... An invaluable portion of scientific data occurs naturally in text form. Given a large unlabeled document collection, it is often helpful to organize this collection into clusters of related documents. By using a vector space model, text data can be treated as high-dimensional but sparse numerical da ..."
Abstract - Cited by 115 (10 self) - Add to MetaCart
data vectors. It is a contemporary challenge to efficiently preprocess and cluster very large document collections. In this paper we present a time and memory ecient technique for the entire clustering process, including the creation of the vector space model. This efficiency is obtained by (i) a

Radio-Wave Propagation Prediction using Ray-Tracing Techniques on a Network of Workstations (NOW) ∗

by Zhongqiang Chen, Alex Delis, Henry L. Bertoni , 2004
"... Ray-tracing based radio wave propagation prediction models play an important role in the design of contemporary wireless networks as they may now take into account diverse physical phenomena including reflections, diffractions, and diffuse scattering. However, such models are computationally expensi ..."
Abstract - Cited by 2 (0 self) - Add to MetaCart
Ray-tracing based radio wave propagation prediction models play an important role in the design of contemporary wireless networks as they may now take into account diverse physical phenomena including reflections, diffractions, and diffuse scattering. However, such models are computationally

Distributed File Systems: Concepts and Examples

by Eliezer Levy, Abraham Silberschatz - ACM Computing Surveys , 1990
"... The purpose of a distributed file system (DFS) is to allow users of physically distributed computers to share data and storage resources by using a common file system. A typical configuration for a DFS is a collection of workstations and mainframes connected by a local area network (LAN). A DFS is i ..."
Abstract - Cited by 93 (0 self) - Add to MetaCart
The purpose of a distributed file system (DFS) is to allow users of physically distributed computers to share data and storage resources by using a common file system. A typical configuration for a DFS is a collection of workstations and mainframes connected by a local area network (LAN). A DFS

Run-time Behavior of Contour Tracing Algorithms for Document Conversion

by Paul C K Kwok, Lok C Wong
"... In this paper, we present the run-time behavior of contour tracing algorithms for processing large documents, in a contemporary workstation environment. The performance criteria examined are processing time, memory usage, and the number of page faults. A new contour tracing algorithm based on Capson ..."
Abstract - Add to MetaCart
In this paper, we present the run-time behavior of contour tracing algorithms for processing large documents, in a contemporary workstation environment. The performance criteria examined are processing time, memory usage, and the number of page faults. A new contour tracing algorithm based

Disconnected Operation for AFS

by L. B. Huston , P. Honeyman , 1993
"... AFS plays a prominent role in our plans for a mobile workstation. The AFS client manages a cache of the most recently used files and directories. But even when the cache is hot, access to cached data frequently involves some communication with one or more file servers to maintain consistency guar ..."
Abstract - Cited by 76 (5 self) - Add to MetaCart
AFS plays a prominent role in our plans for a mobile workstation. The AFS client manages a cache of the most recently used files and directories. But even when the cache is hot, access to cached data frequently involves some communication with one or more file servers to maintain consistency
Next 10 →
Results 1 - 10 of 46
Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University