Sciweavers

67 search results - page 1 / 14
» Algorithms for Variable Length Subnet Address Assignment
Sort
View
TC
1998
13 years 4 months ago
Algorithms for Variable Length Subnet Address Assignment
In a computer network that consists of M subnetworks, the L-bit address of a machine consists of two parts: A pre x si that contains the address of the subnetwork to which the mac...
Mikhail J. Atallah, Douglas Comer
INFOCOM
2002
IEEE
13 years 9 months ago
Optimal Configuration of OSPF Aggregates
—Open Shortest Path First (OSPF) is a popular protocol for routing within an autonomous system (AS) domain. In order to scale for large networks containing hundreds and thousands...
Rajeev Rastogi, Yuri Breitbart, Minos N. Garofalak...
MOBIHOC
2001
ACM
14 years 4 months ago
Distributed assignment of encoded MAC addresses in sensor networks
In wireless sensor networks, the vast majority of wide-scale traffic consists of only a few bytes, including all network and application layer IDs. Therefore, MAC addresses, which...
Curt Schurgers, Gautam Kulkarni, Mani B. Srivastav...
ICASSP
2008
IEEE
13 years 11 months ago
Address assignment sensitive variable partitioning and scheduling for DSPS with multiple memory banks
Multiple memory banks design is employed in many high performance DSP processors. This architectural feature supports higher memory bandwidth by allowing multiple data memory acce...
Chun Jason Xue, Tiantian Liu, Zili Shao, Jingtong ...
GECCO
2000
Springer
114views Optimization» more  GECCO 2000»
13 years 8 months ago
Variable Length Genomes for Evolutionary Algorithms
A general variable length genome, called exG, is developed here to address the problems of fixed length representations in canonical evolutionary algorithms. Convergence aspects o...
C.-Y. Lee, E. K. Antonsson