• 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 473
Next 10 →

Automatically characterizing large scale program behavior

by Timothy Sherwood, Erez Perelman, Greg Hamerly , 2002
"... Understanding program behavior is at the foundation of computer architecture and program optimization. Many pro-grams have wildly different behavior on even the very largest of scales (over the complete execution of the program). This realization has ramifications for many architectural and com-pile ..."
Abstract - Cited by 778 (41 self) - Add to MetaCart
of execution. Our goal is to develop automatic techniques that are ca-pable of finding and exploiting the Large Scale Behavior of programs (behavior seen over billions of instructions). The first step towards this goal is the development of a hardware independent metric that can concisely summarize the behav

Constrained model predictive control: Stability and optimality

by D. Q. Mayne, J. B. Rawlings, C. V. Rao, P. O. M. Scokaert - AUTOMATICA , 2000
"... Model predictive control is a form of control in which the current control action is obtained by solving, at each sampling instant, a finite horizon open-loop optimal control problem, using the current state of the plant as the initial state; the optimization yields an optimal control sequence and t ..."
Abstract - Cited by 738 (16 self) - Add to MetaCart
from an extensive literature essential principles that ensure stability and use these to present a concise characterization of most of the model predictive controllers that have been proposed in the literature. In some cases the finite horizon optimal control problem solved on-line is exactly

R.: A concise characterization of 3D simple points

by Sébastien Fourey, Rémy Malgouyres - Discrete Applied Mathematics , 2003
"... ..."
Abstract - Cited by 9 (0 self) - Add to MetaCart
Abstract not found

Code-Partitioning for a Concise Characterization of Programs for Decoupled Code Tuning

by Eric Petit, François Bodin , 2010
"... Abstract. Astex, Automatic Speculative Thread EXtractor, is a compiler front-end we devellop for automatic C-code partitioning in speculative codelets, i.e. pure function that can be distributed over computing units of a system. It is an hybrid approach mixing static analysis and speculative data fr ..."
Abstract - Add to MetaCart
Abstract. Astex, Automatic Speculative Thread EXtractor, is a compiler front-end we devellop for automatic C-code partitioning in speculative codelets, i.e. pure function that can be distributed over computing units of a system. It is an hybrid approach mixing static analysis and speculative data from profiles to offline generating a partition of the input C sequential code. In addition to the generated C partitioned application, we provide all the information on extracted kernels for a distributed memory heterogeneous system implementation and optimization. Astex makes a full abstraction of the target system for the programmer and provide useful guideline for code refactoring, if needed. It includes time profiling, communication, data layout information and data value prediction. Each codelet can be generated as a stand-alone program with associated input data set for effective iterative optimisation. Astex results on NAS, SPEC 2006 and H264 benchmarks are relevant, and future works are on the way toward automatic specialized coprocessor programming. 1

DOI: 10.1007/3-540-44438-6_3 A concise characterization of 3D simple points

by Sébastien Fourey, Rémy Malgouyres , 2013
"... Abstract. We recall the definition of simple points which uses the digital fundamental group introduced by T.Y.Kong in [Kon89]. Then, we prove that a not less restrictive definition can be given. Indeed, we prove that there is no need of considering the fundamental group of the complement of an obje ..."
Abstract - Add to MetaCart
of an object in order to characterize its simple points. In order to prove this result, we do not use the fact that “the number of holes of X is equal to the number of holes in X ” which is not sufficient for our purpose but we use the linking number defined in [FM00]. In so doing, we formalize the proofs

On Beamforming with Finite Rate Feedback in Multiple Antenna Systems

by Krishna Kiran Mukkavilli, Ashutosh Sabharwal, Elza Erkip, Behnaam Aazhang , 2003
"... In this paper, we study a multiple antenna system where the transmitter is equipped with quantized information about instantaneous channel realizations. Assuming that the transmitter uses the quantized information for beamforming, we derive a universal lower bound on the outage probability for any f ..."
Abstract - Cited by 272 (14 self) - Add to MetaCart
finite set of beamformers. The universal lower bound provides a concise characterization of the gain with each additional bit of feedback information regarding the channel. Using the bound, it is shown that finite information systems approach the perfect information case as (t 1)2 , where B

Software Reuse

by Charles W. Krueger - ACM Computing Surveys , 1992
"... Software reuse is the process ofcreating software systems from existing software rather than building software systems from scratch. ‘l’his simple yet powerful vision was introduced in 1968. Software reuse has, however, failed to become a standard software engineering practice. In an attempt to unde ..."
Abstract - Cited by 307 (2 self) - Add to MetaCart
the field of software reuse. The taxonomy characterizes each reuse approach interms of its reusable artifacts and the way these artifacts are abstracted, selected, speciahzed, and integrated. Abstraction plays a central role in software reuse. Concise and expressive abstractions are essential if software

CONCISE COMMUNICATIONS

by unknown authors , 1992
"... The complete envelopeglycoprotein H (gH) coding sequences of 10 clinicalstrains of cytomeg-alovirus (CMV) were determined and compared with those of laboratory strains AD169 and Towne. Their translated peptide sequences segregated into two groups, exemplified by AD169 and Towne. Peptide variation wa ..."
Abstract - Add to MetaCart
of up to four group-specific peptide configurations at these loci [4, 5]. gH (gp86) was initially characterized by sequencing and reactivity with a neutraliz-ing murine monoclonal antibody [6]. In its glycosylated form, it has a size of 86 kDa and appears to bind a 92.5-kDa cellular receptor [7

Concise Track Characterization of Maneuvering Targets

by Linder , 2001
"... The identification and characterization of targets is difficult using conventional Kalman filter-based trackers, because these trackers are not able to provide an accurate and succinct list of maneuvers for use in track and target identification. We propose a new approach, representing target tracks ..."
Abstract - Cited by 4 (2 self) - Add to MetaCart
to turn rate and heading. Our new approach shows great promise as a technique for ascertaining concise track characterization of maneuvering targets.

Concise Graphs and Functional Bisimulations

by Ling Cheung And, Ling Cheung, Jesse Hughes, Zena M. Ariola
"... We investigate the conditions under which least bisimulations exist with respect to set inclusion. In particular, we describe a natural way to remove redundant pairs from a given bisimulation. We then introduce the conciseness property on process graphs, which characterizes the existence of leas ..."
Abstract - Add to MetaCart
We investigate the conditions under which least bisimulations exist with respect to set inclusion. In particular, we describe a natural way to remove redundant pairs from a given bisimulation. We then introduce the conciseness property on process graphs, which characterizes the existence
Next 10 →
Results 1 - 10 of 473
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