Sciweavers

7 search results - page 1 / 2
» Reducing the Space Complexity of Pipelined Routing Using Mod...
Sort
View
FPL
2006
Springer
96views Hardware» more  FPL 2006»
13 years 8 months ago
Reducing the Space Complexity of Pipelined Routing Using Modified Range Encoding
Interconnect delays are becoming an increasingly significant part of the critical path delay for circuits implemented in FPGAs. Pipelined interconnects have been proposed to addre...
Allan Carroll, Carl Ebeling
MOBIQUITOUS
2007
IEEE
13 years 11 months ago
Assessing Standard and Inverted Skip Graphs Using Multi-Dimensional Range Queries and Mobile Nodes
—The skip graph, an application-layer data structure for routing and indexing, may be used in a sensor network to facilitate queries of the distributed k-dimensional data collect...
Gregory J. Brault, Christopher J. Augeri, Barry E....
ICDCS
2012
IEEE
11 years 7 months ago
Scalable Name Lookup in NDN Using Effective Name Component Encoding
—Name-based route lookup is a key function for Named Data Networking (NDN). The NDN names are hierarchical and have variable and unbounded lengths, which are much longer than IPv...
Yi Wang, Keqiang He, Huichen Dai, Wei Meng, Junche...
ICGA
1997
103views Optimization» more  ICGA 1997»
13 years 6 months ago
Genetic Algorithm for Restrictive Channel Routing Problem
This paper presents a genetic algorithm for the restrictive channel routing problem. The major difference of the algorithm from already known genetic algorithms for this problem c...
Vladimir N. Davidenko, Victor M. Kureichik, Victor...
ACIVS
2005
Springer
13 years 10 months ago
Reduced-Bit, Full Search Block-Matching Algorithms and Their Hardware Realizations
Abstract. The Full Search Block-Matching Motion Estimation (FSBME) algorithm is often employed in video coding for its regular dataflow and straightforward architectures. By iterat...
Vincent M. Dwyer, Shahrukh Agha, Vassilios A. Chou...