Sciweavers

2173 search results - page 414 / 435
» On the Values of Reducibility Candidates
Sort
View
ARVLSI
1995
IEEE
220views VLSI» more  ARVLSI 1995»
14 years 2 hour ago
Optimization of combinational and sequential logic circuits for low power using precomputation
Precomputation is a recently proposed logic optimization technique which selectively disables the inputs of a sequential logic circuit, thereby reducing switching activity and pow...
José Monteiro, John Rinderknecht, Srinivas ...
FOCS
1995
IEEE
13 years 12 months ago
Free Bits, PCPs and Non-Approximability - Towards Tight Results
This paper continues the investigation of the connection between probabilistically checkable proofs PCPs the approximability of NP-optimization problems. The emphasis is on prov...
Mihir Bellare, Oded Goldreich, Madhu Sudan
HICSS
1995
IEEE
128views Biometrics» more  HICSS 1995»
13 years 12 months ago
Instruction Level Parallelism
Abstract. We reexamine the limits of parallelism available in programs, using runtime reconstruction of program data-flow graphs. While limits of parallelism have been examined in...
HIPEAC
2009
Springer
13 years 11 months ago
Accomodating Diversity in CMPs with Heterogeneous Frequencies
Shrinking process technologies and growing chip sizes have profound effects on process variation. This leads to Chip Multiprocessors (CMPs) where not all cores operate at maximum f...
Major Bhadauria, Vincent M. Weaver, Sally A. McKee
AAAI
2007
13 years 10 months ago
Minimal Mental Models
Agents must form and update mental models about each other in a wide range of domains: team coordination, plan recognition, social simulation, user modeling, games of incomplete i...
David V. Pynadath, Stacy Marsella