Sciweavers

3319 search results - page 633 / 664
» The topology of dark networks
Sort
View
SIAMJO
2000
101views more  SIAMJO 2000»
13 years 10 months ago
An Efficient Algorithm for Minimizing a Sum of p-Norms
We study the problem of minimizing a sum of p-norms where p is a fixed real number in the interval [1, ]. Several practical algorithms have been proposed to solve this problem. How...
Guoliang Xue, Yinyu Ye
TCAD
2002
73views more  TCAD 2002»
13 years 10 months ago
A timing-constrained simultaneous global routing algorithm
In this paper, we propose a new approach for VLSI interconnect global routing that can optimize both congestion and delay, which are often competing objectives. Our approach provi...
Jiang Hu, Sachin S. Sapatnekar
TEC
2002
117views more  TEC 2002»
13 years 10 months ago
A genetic algorithm for shortest path routing problem and the sizing of populations
This paper presents a genetic algorithmic approach to the shortest path (SP) routing problem. Variable-length chromosomes (strings) and their genes (parameters) have been used for ...
Chang Wook Ahn, Rudrapatna S. Ramakrishna
TROB
2002
140views more  TROB 2002»
13 years 10 months ago
Hormone-inspired adaptive communication and distributed control for CONRO self-reconfigurable robots
This paper presents a biologically inspired approach to two basic problems in modular self-reconfigurable robots: adaptive communication in self-reconfigurable and dynamic networks...
Wei-Min Shen, Behnam Salemi, Peter M. Will
LATIN
2010
Springer
13 years 9 months ago
Packet Routing on the Grid
The packet routing problem, i.e., the problem to send a given set of unit-size packets through a network on time, belongs to one of the most fundamental routing problems with impor...
Britta Peis, Martin Skutella, Andreas Wiese