Sciweavers

2038 search results - page 27 / 408
» Loops under Strategies
Sort
View
ICCAD
2007
IEEE
161views Hardware» more  ICCAD 2007»
14 years 4 months ago
Clustering based pruning for statistical criticality computation under process variations
— We present a new linear time technique to compute criticality information in a timing graph by dividing it into “zones”. Errors in using tightness probabilities for critica...
Hushrav Mogal, Haifeng Qian, Sachin S. Sapatnekar,...
JSAC
2011
82views more  JSAC 2011»
13 years 2 months ago
Optimal Cognitive Access of Markovian Channels under Tight Collision Constraints
Abstract—The problem of cognitive access of channels of primary users by a secondary user is considered. The transmissions of primary users are modeled as independent continuous-...
Xin Li, Qianchuan Zhao, Xiaohong Guan, Lang Tong
CDC
2008
IEEE
112views Control Systems» more  CDC 2008»
13 years 9 months ago
Information fusion strategies from distributed filters in packet-drop networks
Abstract-- In this paper we study different distributed estimation schemes for stochastic discrete time linear systems where the communication between the sensors and the estimatio...
Alessandro Chiuso, Luca Schenato
ICFP
1999
ACM
13 years 12 months ago
Programming Languages as Operating Systems (or Revenge of the Son of the Lisp Machine)
The MrEd virtual machine serves both as the implementation platform for the DrScheme programming environment, and as the underlying Scheme engine for executing expressions and pro...
Matthew Flatt, Robert Bruce Findler, Shriram Krish...
CGO
2008
IEEE
14 years 2 months ago
Prediction and trace compression of data access addresses through nested loop recognition
This paper describes an algorithm that takes a trace (i.e., a sequence of numbers or vectors of numbers) as input, and from that produces a sequence of loop nests that, when run, ...
Alain Ketterlin, Philippe Clauss