Sciweavers

4940 search results - page 745 / 988
» On the Complexity of Universal Programs
Sort
View
ICS
2000
Tsinghua U.
15 years 10 months ago
A low-complexity issue logic
One of the main concerns in today's processor design is the issue logic. Instruction-level parallelism is usually favored by an out-of-order issue mechanism where instruction...
Ramon Canal, Antonio González
ISSS
1995
IEEE
115views Hardware» more  ISSS 1995»
15 years 10 months ago
A system level design methodology for the optimization of heterogeneous multiprocessors
This paper presents a system level design methodology and its implementation as CAD tool for the optimization of heterogeneous multiprocessor systems. These heterogeneous systems,...
Markus Schwiegershausen, Peter Pirsch
SIGIR
1995
ACM
15 years 10 months ago
A Trainable Document Summarizer
To summarize is to reducein complexity, and hencein length, while retaining some of the essential qualities of the original. This paper focusses on document extracts, a particular...
Julian Kupiec, Jan O. Pedersen, Francine Chen
COCO
1991
Springer
173views Algorithms» more  COCO 1991»
15 years 10 months ago
On the Random-Self-Reducibility of Complete Sets
Abstract. In this paper, we generalize the previous formal de nitions of random-self-reducibility. We show that, even under our very general de nition, sets that are complete for a...
Joan Feigenbaum, Lance Fortnow
DBPL
1991
Springer
76views Database» more  DBPL 1991»
15 years 10 months ago
A Functional DBPL Revealing High Level Optimizations
We present a functional DBPL in the style of FP that facilitates the definition of precise semantics and opens up opportunities for far-reaching optimizations. The language is int...
Martin Erwig, Udo W. Lipeck