Sciweavers

6409 search results - page 293 / 1282
» A Computational Algorithm for Origami Design
Sort
View
FPGA
2004
ACM
137views FPGA» more  FPGA 2004»
16 years 7 hour ago
Multi-resource aware partitioning algorithms for FPGAs with heterogeneous resources
As FPGA densities increase, partitioning-based FPGA placement approaches are becoming increasingly important as they can be used to provide high-quality and computationally scalab...
Navaratnasothie Selvakkumaran, Abhishek Ranjan, Sa...
MOBIHOC
2008
ACM
16 years 6 months ago
Construction algorithms for k-connected m-dominating sets in wireless sensor networks
A Connected Dominating Set (CDS) working as a virtual backbone is an effective way to decrease the overhead of routing in a wireless sensor network. Furthermore, a kConnected m-Do...
Yiwei Wu, Yingshu Li
SENSYS
2003
ACM
15 years 12 months ago
Matching data dissemination algorithms to application requirements
A distinguishing characteristic of wireless sensor networks is the opportunity to exploit characteristics of the application at lower layers. This approach is encouraged by device...
John S. Heidemann, Fabio Silva, Deborah Estrin
SENSYS
2006
ACM
16 years 17 days ago
Target tracking with binary proximity sensors: fundamental limits, minimal descriptions, and algorithms
We explore fundamental performance limits of tracking a target in a two-dimensional field of binary proximity sensors, and design algorithms that attain those limits. In particul...
Nisheeth Shrivastava, Raghuraman Mudumbai, Upamany...
CSREAESA
2003
15 years 8 months ago
Common Mistakes in Adiabatic Logic Design and How to Avoid Them
Most so-called “adiabatic” digital logic circuit families reported in the low-power design literature are actually not truly adiabatic, in that they do not satisfy the general...
Michael P. Frank