Sciweavers

4037 search results - page 27 / 808
» Routing without ordering
Sort
View
AIPS
2007
13 years 10 months ago
Prioritizing Bellman Backups without a Priority Queue
Several researchers have shown that the efficiency of value iteration, a dynamic programming algorithm for Markov decision processes, can be improved by prioritizing the order of...
Peng Dai, Eric A. Hansen
ICCAD
2009
IEEE
92views Hardware» more  ICCAD 2009»
13 years 5 months ago
How to consider shorts and guarantee yield rate improvement for redundant wire insertion
This paper accurately considers wire short defects and proposes an algorithm to guarantee IC chip yield rate improvement for redundant wire insertion. Without considering yield ra...
Fong-Yuan Chang, Ren-Song Tsay, Wai-Kei Mak
WWIC
2007
Springer
247views Communications» more  WWIC 2007»
14 years 1 months ago
Reliable Geographical Multicast Routing in Vehicular Ad-Hoc Networks
Vehicular ad-hoc networks (VANETs) offer a large number of new potential applications without relying on significant infrastructure. Many of these applications benefit from multi-h...
Maria Kihl, Mihail L. Sichitiu, Ted Ekeroth, Micha...
DATE
2003
IEEE
120views Hardware» more  DATE 2003»
14 years 29 days ago
Crosstalk Reduction in Area Routing
Interconnect delay dominates system delay in modern circuits, and with reduced feature sizes, coupling capacitance and signal crosstalk have become significant issues. By spacing...
Ryon M. Smey, Bill Swartz, Patrick H. Madden
ICOIN
2003
Springer
14 years 26 days ago
Information-Theoretic Bounds for Mobile Ad-hoc Networks Routing Protocols
Abstract. In this paper, we define the routing overhead as the amount of information needed to describe the changes in a network topology. We derive a universal lower bound on the...
Nianjun Zhou, Alhussein A. Abouzeid