8695 search results - page 1679 / 1739 » Making the Complex Simple |
120
click to vote
TYPES
2000
Springer
15 years 1 months ago
2000
Springer
Abstract. In the FTA project in Nijmegen we have formalized a constructive proof of the Fundamental Theorem of Algebra. In the formalization, we have first defined the (constructiv...
111
click to vote
ISSS
1995
IEEE
15 years 1 months ago
1995
IEEE
To construct complete systems on silicon, application speci c DSP accelerators are needed to speed up the execution of high throughput DSP algorithms. In this paper, a methodology...
105
click to vote
KBSE
1995
IEEE
15 years 1 months ago
1995
IEEE
Cost-effective engineering and evolution of complex software must involve the different stakeholders concurrently and collaboratively. The hard problem is providing computer suppo...
SC
1995
ACM
15 years 1 months ago
1995
ACM
Recently, a number of researchers have investigated a class of algorithms that are based on multilevel graph partitioning that have moderate computational complexity, and provide ...
MICRO
1991
IEEE
15 years 1 months ago
1991
IEEE
This paper examines two alternative approaches to supporting code scheduling for multiple-instruction-issue processors. One is to provide a set of non-trapping instructions so tha...