Sciweavers

16404 search results - page 3173 / 3281
» A set coverage problem
Sort
View
144
Voted
CONPAR
1994
15 years 7 months ago
A Framework for Resource-Constrained Rate-Optimal Software Pipelining
The rapid advances in high-performancecomputer architectureand compilationtechniques provide both challenges and opportunitiesto exploitthe rich solution space of software pipeline...
Ramaswamy Govindarajan, Erik R. Altman, Guang R. G...
PLDI
1994
ACM
15 years 7 months ago
Memory Access Coalescing: A technique for Eliminating Redundant memory Accesses
As microprocessor speeds increase, memory bandwidth is increasing y the performance bottleneck for microprocessors. This has occurred because innovation and technological improvem...
Jack W. Davidson, Sanjay Jinturkar
STOC
1993
ACM
134views Algorithms» more  STOC 1993»
15 years 7 months ago
Quantum complexity theory
In this paper we study quantum computation from a complexity theoretic viewpoint. Our first result is the existence of an efficient universal quantum Turing machine in Deutsch’s...
Ethan Bernstein, Umesh V. Vazirani
DBPL
1989
Springer
165views Database» more  DBPL 1989»
15 years 7 months ago
Support for Data-Intensive Applications: Conceptual Design and Software Development
In the process of developing an Information System, one passes through stages that include requirements gathering, design specification, and software implementation. The purpose ...
Alexander Borgida, John Mylopoulos, Joachim W. Sch...
AGTIVE
2007
Springer
15 years 7 months ago
Transforming Timeline Specifications into Automata for Runtime Monitoring
Abstract. In runtime monitoring, a programmer specifies code to execute whenever a sequence of events occurs during program execution. Previous and related work has shown that runt...
Eric Bodden, Hans Vangheluwe
« Prev « First page 3173 / 3281 Last » Next »