Sciweavers

4287 search results - page 405 / 858
» Assessing Architectural Complexity
Sort
View
JSAT
2008
85views more  JSAT 2008»
15 years 6 months ago
Parallel SAT Solving using Bit-level Operations
We show how to exploit the 32/64 bit architecture of modern computers to accelerate some of the algorithms used in satisfiability solving by modifying assignments to variables in ...
Marijn Heule, Hans van Maaren
EOR
2007
87views more  EOR 2007»
15 years 6 months ago
An optimal and scalable parallelization of the two-list
In this paper, we suggest a parallel algorithm based on a shared memory SIMD architecture for solving an n item subset-sum problem in time O(2n/2 /p) by using p = 2q processors, 0...
Carlos Alberto Alonso Sanches, Nei Yoshihiro Soma,...
ET
2007
123views more  ET 2007»
15 years 6 months ago
Defect-tolerant Logic with Nanoscale Crossbar Circuits
Crossbar architectures are one approach to molecular electronic circuits for memory and logic applications. However, currently feasible manufacturing technologies introduce numero...
Tad Hogg, Greg Snider
PE
2006
Springer
127views Optimization» more  PE 2006»
15 years 6 months ago
Cycloid: A constant-degree and lookup-efficient P2P overlay network
There are many structured P2P systems that use DHT technologies to map data items onto the nodes in various ways for scalable routing and location. Most of the systems require O(lo...
Haiying Shen, Cheng-Zhong Xu, Guihai Chen
CIE
2004
Springer
15 years 6 months ago
University of Southern California's Institute for Creative Technologies
When dealing with large, distributed systems that use state-of-the-art components, individual components are usually developed in parallel. As development continues, the decouplin...
Michael van Lent