Sciweavers

4809 search results - page 368 / 962
» CajunBot: Architecture and algorithms
Sort
View
ICC
2007
IEEE
118views Communications» more  ICC 2007»
15 years 10 months ago
Efficient Group Management For Inter-PN Access Control
This paper presents an architecture for resource sharing in Personal Networks (PNs). Resources are not necessarily in the same authentication domain and the group that uses them is...
Ahmad Ahmad, Khaled Masmoudi, Hossam Afifi
DAC
1995
ACM
15 years 10 months ago
A Method for Finding Good Ashenhurst Decompositions and Its Application to FPGA Synthesis
—In this paper, we present an algorithm for finding a good Ashenhurst decomposition of a switching function. Most current methods for performing this type of decomposition are ba...
Ted Stanion, Carl Sechen
IEEEPACT
2008
IEEE
16 years 1 months ago
Scalable and reliable communication for hardware transactional memory
In a hardware transactional memory system with lazy versioning and lazy conflict detection, the process of transaction commit can emerge as a bottleneck. This is especially true ...
Seth H. Pugsley, Manu Awasthi, Niti Madan, Naveen ...
DAC
2009
ACM
16 years 7 months ago
Efficient SAT solving for non-clausal formulas using DPLL, graphs, and watched cuts
Boolean satisfiability (SAT) solvers are used heavily in hardware and software verification tools for checking satisfiability of Boolean formulas. Most state-of-the-art SAT solver...
Himanshu Jain, Edmund M. Clarke
DAC
2007
ACM
16 years 7 months ago
GlitchMap: An FPGA Technology Mapper for Low Power Considering Glitches
In 90-nm technology, dynamic power is still the largest power source in FPGAs [1], and signal glitches contribute a large portion of the dynamic power consumption. Previous powera...
Lei Cheng, Deming Chen, Martin D. F. Wong