• Documents
  • Authors
  • Tables

CiteSeerX logo

Advanced Search Include Citations

Tools

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

Automatic Translation of FORTRAN Programs to Vector Form

by Randy Allen, Ken Kennedy - ACM Transactions on Programming Languages and Systems , 1987
"... This paper discusses the theoretical concepts underlying a project at Rice University to develop an automatic translator, called PFC (for Parallel FORTRAN Converter), from FORTRAN to FORTRAN 8x. The Rice project, based initially upon the research of Kuck and others at the University of Illinois [6, ..."
Abstract - Cited by 329 (34 self) - Add to MetaCart
, 17-21, 24, 32, 36], is a continuation of work begun while on leave at IBM Research in Yorktown Heights, N.Y. Our first implementation was based on the Illinois PARAFRASE compiler [20, 36], but the current version is a completely new program (although it performs many of the same transformations

Avrora: Scalable Sensor Network Simulation With Precise Timing

by Ben L. Titzer, et al. - IN PROC. OF THE 4TH INTL. CONF. ON INFORMATION PROCESSING IN SENSOR NETWORKS (IPSN , 2005
"... Simulation can be an important step in the development of software for wireless sensor networks and has been the subject of intense research in the past decade. While most previous efforts in simulating wireless sensor networks have focused on protocol-level issues utilizing models of the software i ..."
Abstract - Cited by 270 (5 self) - Add to MetaCart
implementation, a significant challenge remains in precisely measuring time-dependent properties such as radio channel utilization. One promising approach, first demonstrated by ATEMU, is to simulate the behavior of sensor network programs at the machine code level with cycle-accuracy, but poor performance has

Smooth View-Dependent Level-of-Detail Control and Its Application to Terrain Rendering

by Hugues Hoppe
"... The key to real-time rendering of large-scale surfaces is to locally adapt surface geometric complexity to changing view parameters. Several schemes have been developed to address this problem of view-dependent level-of-detail control. Among these, the viewdependent progressive mesh (VDPM) framewor ..."
Abstract - Cited by 264 (1 self) - Add to MetaCart
The key to real-time rendering of large-scale surfaces is to locally adapt surface geometric complexity to changing view parameters. Several schemes have been developed to address this problem of view-dependent level-of-detail control. Among these, the viewdependent progressive mesh (VDPM

CODA: Congestion detection and avoidance in sensor networks

by Chieh-yih Wan, Shane B. Eisenman , 2003
"... Event-driven sensor networks operate under an idle or light load and then suddenly become active in response to a detected or monitored event. The transport of event impulses is likely to lead to varying degrees of congestion in the network depending on the sensing application. It is during these pe ..."
Abstract - Cited by 244 (9 self) - Add to MetaCart
mechanisms: (i) receiver-based congestion detection; (ii) open-loop hop-by-hop backpressure; and (iii) closed-loop multi-source regulation. We present the detailed design, implementation, and evaluation of CODA using simulation and experimentation. We define two important performance metrics (i.e., energy

Implementing lazy functional languages on stock hardware: the Spineless Tagless G-machine - Version 2.5

by Simon L Peyton Jones - JOURNAL OF FUNCTIONAL PROGRAMMING , 1992
"... The Spineless Tagless G-machine is an abstract machine designed to support nonstrict higher-order functional languages. This presentation of the machine falls into three parts. Firstly, we give a general discussion of the design issues involved in implementing non-strict functional languages. Next, ..."
Abstract - Cited by 221 (21 self) - Add to MetaCart
language onto stock hardware. The success of an abstract machine model depends largely on how efficient this mapping can be made, though this topic is often relegated to a short section. Instead, we give a detailed discussion of the design issues and the choices we have made. Our principal target is the C

A Foundation for Representing and Querying Moving Objects

by Ralf Hartmut Güting , Michael H. Böhlen , Martin Erwig , Christian S. Jensen , Nikos A. Lorentzos , Markus Schneider , Michalis Vazirgiannis , 2000
"... Spatio-temporal databases deal with geometries changing over time. The goal of our work is to provide a DBMS data model and query language capable of handling such time-dependent geometries, including those changing continuously which describe moving objects. Two fundamental abstractions are moving ..."
Abstract - Cited by 200 (39 self) - Add to MetaCart
Spatio-temporal databases deal with geometries changing over time. The goal of our work is to provide a DBMS data model and query language capable of handling such time-dependent geometries, including those changing continuously which describe moving objects. Two fundamental abstractions are moving

Iterated local search

by Helena R. Lourenço, Olivier C. Martin, Thomas Stützle - Handbook of Metaheuristics, volume 57 of International Series in Operations Research and Management Science , 2002
"... Iterated Local Search has many of the desirable features of a metaheuristic: it is simple, easy to implement, robust, and highly effective. The essential idea of Iterated Local Search lies in focusing the search not on the full space of solutions but on a smaller subspace defined by the solutions th ..."
Abstract - Cited by 172 (15 self) - Add to MetaCart
Iterated Local Search has many of the desirable features of a metaheuristic: it is simple, easy to implement, robust, and highly effective. The essential idea of Iterated Local Search lies in focusing the search not on the full space of solutions but on a smaller subspace defined by the solutions

Protocol independent multicast-sparse mode (PIM-SM): Protocol specification

by D. Farinacci, A. Helmy, D. Thaler, S. Deering, M. Handley, V. Jacobson, C. Liu, P. Sharma, L. Wei , 1998
"... This memo defines an Experimental Protocol for the Internet community. This memo does not specify an Internet standard of any kind. Discussion and suggestions for improvement are requested. Distribution of this memo is unlimited. Acknowledgements The author list has been reordered to reflect the inv ..."
Abstract - Cited by 163 (13 self) - Add to MetaCart
-SM) because it is not dependent on any particular unicast routing protocol, and because it is designed to support sparse groups as defined in [1][2]. This document describes the protocol details. For the motivation behind the design and a description of the architecture, see [1][2]. Section 2 summarizes PIM

A Proposal for a Description Logic Interface

by Sean Bechhofer , Ian Horrocks , Peter F. Patel-schneider , Sergio Tessaris
"... Most description logic (DL) systems present the application programmer with a functional interface, often defined using a Lisp-like syntax. Such interfaces may be more or less complex, depending on the sophistication of the implemented system, and may be more or less compliant with the KRSS descript ..."
Abstract - Cited by 143 (18 self) - Add to MetaCart
Most description logic (DL) systems present the application programmer with a functional interface, often defined using a Lisp-like syntax. Such interfaces may be more or less complex, depending on the sophistication of the implemented system, and may be more or less compliant with the KRSS

The Flux OSKit: A Substrate for Kernel and Language Research

by Bryan Ford , Godmar Back , Greg Benson , Jay Lepreau , Albert Lin , Olin Shivers , 1997
"... Abstract Implementing new operating systems is tedious, costly, and often impractical except for large projects. The Flux OSKit addresses this problem in a novel way by providing clean, well-documented OS components designed to be reused in a wide variety of other environments, rather than defining ..."
Abstract - Cited by 138 (1 self) - Add to MetaCart
defining a new OS structure. The OSKit uses unconventional techniques to maximize its usefulness, such as intentionally exposing implementation details and platform-specific facilities. Further, the OSKit demonstrates a technique that allows unmodified code from existing mature operating systems
Next 10 →
Results 1 - 10 of 6,012
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