279 search results - page 40 / 56 » Degree-bounded minimum spanning trees |
127
Voted
FPGA
2003
ACM
15 years 9 months ago
2003
ACM
We present a pipelining-aware router for FPGAs. The problem of routing pipelined signals is different from the conventional FPGA routing problem. For example, the two terminal N-D...
125
Voted
IPPS
2007
IEEE
15 years 10 months ago
2007
IEEE
Due to fundamental physical limitations and power constraints, we are witnessing a radical change in commodity microprocessor architectures to multicore designs. Continued perform...
116
click to vote
JPDC
2006
15 years 3 months ago
2006
A fully unsafe hypercube according to the global safety can be split into a unique set of maximal safe subcubes. Multicasting in a maximal safe subcube can be completed reliably b...
144
Voted
ALGORITHMICA
2002
15 years 3 months ago
2002
Let S be a set of n points in a metric space, and k a positive integer. Algorithms are given that construct k-fault-tolerant spanners for S. If in such a spanner at most k vertice...
125
click to vote
GECCO
2007
Springer
15 years 10 months ago
2007
Springer
We analyze the performance of evolutionary algorithms on various matroid optimization problems that encompass a vast number of efficiently solvable as well as NP-hard combinatoria...