Sciweavers

4940 search results - page 33 / 988
» On the Complexity of Universal Programs
Sort
View
ISCA
1998
IEEE
135views Hardware» more  ISCA 1998»
15 years 5 months ago
Branch Prediction Based on Universal Data Compression Algorithms
Data compression and prediction are closely related. Thus prediction methods based on data compression algorithms have been suggested for the branch prediction problem. In this wo...
Eitan Federovsky, Meir Feder, Shlomo Weiss
117
Voted
MP
2006
101views more  MP 2006»
15 years 1 months ago
Computational complexity of stochastic programming problems
Stochastic programming is the subfield of mathematical programming that considers optimization in the presence of uncertainty. During the last four decades a vast amount of litera...
Martin E. Dyer, Leen Stougie
SIGUCCS
2003
ACM
15 years 7 months ago
Colgate university's ITS study groups: in-house personal and professional development
Internal Study Groups at Colgate University have increased staff members’ technical knowledge, encouraged additional study on selected topics, and resulted in achievement of ind...
Jeanne Kellogg
120
Voted
COMPUTER
1998
94views more  COMPUTER 1998»
15 years 1 months ago
Multiprocessors Should Support Simple Memory-Consistency Models
provide tools or abstractions that allow developers to program in parallel. But what hardware do we need to support shared memory threads? The hardware should provide a well-defin...
Mark D. Hill
ESOP
2010
Springer
15 years 8 months ago
A Universal Calculus for Stream Processing Languages
Stream processing applications such as algorithmic trading, MPEG processing, and web content analysis are ubiquitous and essential to business and entertainment. Language designers...
Robert Soulé, Martin Hirzel, Robert Grimm, ...