13214 search results - page 382 / 2643 » Pseudorandomness for network algorithms |
198
click to vote
ICCAD
2000
IEEE
15 years 11 months ago
2000
IEEE
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...
175
click to vote
NIPS
2004
15 years 8 months ago
2004
Existing algorithms for discrete partially observable Markov decision processes can at best solve problems of a few thousand states due to two important sources of intractability:...
172
Voted
JPDC
2006
15 years 6 months ago
2006
Minimum Spanning Tree (MST) is one of the most studied combinatorial problems with practical applications in VLSI layout, wireless communication, and distributed networks, recent ...
156
click to vote
CEC
2005
IEEE
16 years 14 days ago
2005
IEEE
A genetic algorithm approach for segmented channel routing in field programmable gate arrays (FPGA's) is presented in this paper. The FPGA segmented channel routing problem (F...
163
click to vote
SKG
2005
IEEE
16 years 12 days ago
2005
IEEE
This paper proposes a set of novel distributed algorithms on top of m-D irregular mesh overlay to achieve the short delay and low network resource consumption end host multicast s...