Sciweavers

2482 search results - page 375 / 497
» Characterizing Programming Systems Allowing Program Self-ref...
Sort
View
LCPC
2000
Springer
14 years 27 days ago
Efficient Dynamic Local Enumeration for HPF
In translating HPF programs, a compiler has to generate local iteration and communication sets. Apart from local enumeration, local storage compression is an issue, because in HPF ...
Will Denissen, Henk J. Sips
ASPLOS
2008
ACM
13 years 11 months ago
Hardware counter driven on-the-fly request signatures
Today's processors provide a rich source of statistical information on application execution through hardware counters. In this paper, we explore the utilization of these sta...
Kai Shen, Ming Zhong, Sandhya Dwarkadas, Chuanpeng...
AUTOMATICA
2006
125views more  AUTOMATICA 2006»
13 years 9 months ago
Optimization over state feedback policies for robust control with constraints
This paper is concerned with the optimal control of linear discrete-time systems, which are subject to unknown but bounded state disturbances and mixed constraints on the state an...
Paul J. Goulart, Eric C. Kerrigan, Jan M. Maciejow...
ICSE
2012
IEEE-ACM
11 years 11 months ago
Engineering and verifying requirements for programmable self-assembling nanomachines
—We propose an extension of van Lamsweerde’s goal-oriented requirements engineering to the domain of programmable DNA nanotechnology. This is a domain in which individual devic...
Robyn R. Lutz, Jack H. Lutz, James I. Lathrop, Tit...
LOGCOM
2011
13 years 6 days ago
Introducing Preferences in Planning as Satisfiability
Planning as Satisfiability is one of the most well-known and effective techniques for classical planning: satplan has been the winning system in the deterministic track for optim...
Enrico Giunchiglia, Marco Maratea