Sciweavers

11565 search results - page 2139 / 2313
» Computing Minimal Mappings
Sort
View
MOBIHOC
2003
ACM
16 years 4 months ago
Lightweight sensing and communication protocols for target enumeration and aggregation
The development of lightweight sensing and communication protocols is a key requirement for designing resource constrained sensor networks. This paper introduces a set of efficien...
Qing Fang, Feng Zhao, Leonidas J. Guibas
MOBIHOC
2003
ACM
16 years 4 months ago
SHARP: a hybrid adaptive routing protocol for mobile ad hoc networks
A central challenge in ad hoc networks is the design of routing protocols that can adapt their behavior to frequent and rapid changes in the network. The performance of proactive ...
Venugopalan Ramasubramanian, Zygmunt J. Haas, Emin...
EUROSYS
2006
ACM
16 years 2 months ago
Reducing TCB complexity for security-sensitive applications: three case studies
The large size and high complexity of securitysensitive applications and systems software is a primary cause for their poor testability and high vulnerability. One approach to all...
Lenin Singaravelu, Calton Pu, Hermann Härtig,...
ICCAD
2003
IEEE
109views Hardware» more  ICCAD 2003»
16 years 1 months ago
Large-Scale Circuit Placement: Gap and Promise
Placement is one of the most important steps in the RTLto-GDSII synthesis process, as it directly defines the interconnects, which have become the bottleneck in circuit and syste...
Jason Cong, Tim Kong, Joseph R. Shinnerl, Min Xie,...
ICCAD
2003
IEEE
219views Hardware» more  ICCAD 2003»
16 years 1 months ago
A Min-Cost Flow Based Detailed Router for FPGAs
Routing for FPGAs has been a very challenging problem due to the limitation of routing resources. Although the FPGA routing problem has been researched extensively, most algorithm...
Seokjin Lee, Yongseok Cheon, Martin D. F. Wong
« Prev « First page 2139 / 2313 Last » Next »