Sciweavers

1920 search results - page 278 / 384
» The Complexity of the A B C Problem
Sort
View
MOBIHOC
2006
ACM
14 years 8 months ago
MLS: : an efficient location service for mobile ad hoc networks
MLS is a distributed location service to track the position of mobile nodes and to route messages between any two nodes. The lookup of nodes is achieved by searching in a hierarch...
Roland Flury, Roger Wattenhofer
MOBIHOC
2004
ACM
14 years 8 months ago
A unified MAC layer framework for ad-hoc networks with smart antennas
Smart antennas represent a broad variety of antennas that differ in their performance and transceiver complexity. The superior capabilities of smart antennas, however, can be leve...
Karthikeyan Sundaresan, Raghupathy Sivakumar
MOBIHOC
2003
ACM
14 years 8 months ago
Worst-Case optimal and average-case efficient geometric ad-hoc routing
In this paper we present GOAFR, a new geometric ad-hoc routing algorithm combining greedy and face routing. We evaluate this algorithm by both rigorous analysis and comprehensive ...
Fabian Kuhn, Roger Wattenhofer, Aaron Zollinger
ICCAD
2008
IEEE
125views Hardware» more  ICCAD 2008»
14 years 5 months ago
A succinct memory model for automated design debugging
— In today’s complex SoC designs, verification and debugging are becoming ever more crucial and increasingly timeconsuming tasks. The prevalence of embedded memories adds to t...
Brian Keng, Hratch Mangassarian, Andreas G. Veneri...
ICCAD
2003
IEEE
113views Hardware» more  ICCAD 2003»
14 years 5 months ago
Retiming with Interconnect and Gate Delay
In this paper, we study the problem of retiming of sequential circuits with both interconnect and gate delay. Most retiming algorithms have assumed ideal conditions for the non-lo...
Chris C. N. Chu, Evangeline F. Y. Young, Dennis K....