Sciweavers

4940 search results - page 957 / 988
» On the Complexity of Universal Programs
Sort
View
ISCA
2002
IEEE
91views Hardware» more  ISCA 2002»
14 years 2 months ago
Slack: Maximizing Performance Under Technological Constraints
Many emerging processor microarchitectures seek to manage technological constraints (e.g., wire delay, power, and circuit complexity) by resorting to nonuniform designs that provi...
Brian A. Fields, Rastislav Bodík, Mark D. H...
GECCO
2009
Springer
193views Optimization» more  GECCO 2009»
14 years 2 months ago
Optimization of dynamic memory managers for embedded systems using grammatical evolution
New portable consumer embedded devices must execute multimedia applications (e.g., 3D games, video players and signal processing software, etc.) that demand extensive memory acces...
José L. Risco-Martín, David Atienza,...
CRYPTO
2001
Springer
152views Cryptology» more  CRYPTO 2001»
14 years 2 months ago
Secure Distributed Linear Algebra in a Constant Number of Rounds
Consider a network of processors among which elements in a finite field K can be verifiably shared in a constant number of rounds. Assume furthermore constant-round protocols ar...
Ronald Cramer, Ivan Damgård
NOMS
2000
IEEE
176views Communications» more  NOMS 2000»
14 years 2 months ago
Design and analysis of a proactive application management system (PAMS)
Management of large-scale Network-Centric Systems (NCS) and their applications is an extremely complex and challenging task due to factors such as centralized management architect...
Salim Hariri, Yoonhee Kim
ISSTA
2000
ACM
14 years 2 months ago
Which pointer analysis should I use?
During the past two decades many di erent pointer analysis algorithms have been published. Although some descriptions include measurements of the e ectiveness of the algorithm, qu...
Michael Hind, Anthony Pioli