Sciweavers

361 search results - page 70 / 73
» Approximate counting by dynamic programming
Sort
View
163
Voted
MICRO
1998
IEEE
144views Hardware» more  MICRO 1998»
15 years 8 months ago
Analyzing the Working Set Characteristics of Branch Execution
To achieve highly accurate branch prediction, it is necessary not only to allocate more resources to branch prediction hardware but also to improve the understanding of branch exe...
Sangwook P. Kim, Gary S. Tyson
150
Voted
CASES
2007
ACM
15 years 7 months ago
Performance optimal processor throttling under thermal constraints
We derive analytically, the performance optimal throttling curve for a processor under thermal constraints for a given task sequence. We found that keeping the chip temperature co...
Ravishankar Rao, Sarma B. K. Vrudhula
162
Voted
CCS
2007
ACM
15 years 7 months ago
Analyzing network traffic to detect self-decrypting exploit code
Remotely-launched software exploits are a common way for attackers to intrude into vulnerable computer systems. As detection techniques improve, remote exploitation techniques are...
Qinghua Zhang, Douglas S. Reeves, Peng Ning, S. Pu...
116
Voted
EOR
2008
123views more  EOR 2008»
15 years 3 months ago
Fixed versus flexible production systems: A real options analysis
In this work, we address investment decisions in production systems by using real options. As is standard in literature, the stochastic variable is assumed to be normally distribu...
Dalila B. M. M. Fontes
157
Voted
CDC
2008
IEEE
132views Control Systems» more  CDC 2008»
15 years 10 months ago
A distributed auction algorithm for the assignment problem
— The assignment problem constitutes one of the fundamental problems in the context of linear programming. Besides its theoretical significance, its frequent appearance in the a...
Michael M. Zavlanos, Leonid Spesivtsev, George J. ...