8125 search results - page 1366 / 1625 » Parallelism and evolutionary algorithms |
150
click to vote
INFOCOM
1995
IEEE
15 years 8 months ago
1995
IEEE
—In this paper, we derive a time-complexity bound for the gradient projection method for optimal routing in data networks. This result shows that the gradient projection algorith...
143
click to vote
DAWAK
2008
Springer
15 years 6 months ago
2008
Springer
The DWS (Data Warehouse Striping) technique is a data partitioning approach especially designed for distributed data warehousing environments. In DWS the fact tables are distribute...
164
click to vote
MASCOTS
2010
15 years 6 months ago
2010
Execution and communication traces are central to performance modeling and analysis. Since the traces can be very long, meaningful compression and extraction of representative beha...
164
click to vote
MASCOTS
2007
2007
A Novel Flow Control Scheme for Best Effort Traffic in NoC Based on Source Rate Utility Maximization
15 years 6 months ago
—Advances in semiconductor technology, has enabled designers to put complex, massively parallel multiprocessor systems on a single chip. Network on Chip (NoC) that supports high ...
155
click to vote
ERSA
2006
15 years 6 months ago
2006
MIMO systems have attracted great attentions because of their huge capacity. The hardware implementation of MIMO decoder becomes a challenging task as the complexity of the MIMO sy...