Sciweavers

2316 search results - page 138 / 464
» The many forms of hypercomputation
Sort
View
CSR
2006
Springer
15 years 8 months ago
Extended Resolution Proofs for Conjoining BDDs
We present a method to convert the construction of binary decision diagrams (BDDs) into extended resolution proofs. Besides in proof checking, proofs are fundamental to many applic...
Carsten Sinz, Armin Biere
ESA
2006
Springer
103views Algorithms» more  ESA 2006»
15 years 8 months ago
Greedy in Approximation Algorithms
The objective of this paper is to characterize classes of problems for which a greedy algorithm finds solutions provably close to optimum. To that end, we introduce the notion of k...
Julián Mestre
FPL
2006
Springer
91views Hardware» more  FPL 2006»
15 years 8 months ago
Multi-Bit Carry Chains for High-Performance Reconfigurable Fabrics
Ripple-carry architectures are the norm in today's reconfigurable fabrics. They are simple, require minimal routing, and are easily formed across arbitrary cells in a fabric....
Michael T. Frederick, Arun K. Somani
CCGRID
2001
IEEE
15 years 8 months ago
Supporting Disconnectedness-Transparent Information Delivery for Mobile and Invisible Computing
As computing devices become ubiquitous and increasingly mobile, it is becoming apparent that the directed peerto-peer communication model has shortcomings for many forms of distri...
Peter Sutton, Rhys Arkins, Bill Segall
EUROPAR
2000
Springer
15 years 8 months ago
Cache Remapping to Improve the Performance of Tiled Algorithms
With the increasing processing power, the latency of the memory hierarchy becomes the stumbling block of many modern computer architectures. In order to speed-up the calculations, ...
Kristof Beyls, Erik H. D'Hollander