42230 search results - page 279 / 8446 » Algorithms and Complexity Results for |
152
click to vote
INFOCOM
1997
IEEE
15 years 11 months ago
1997
IEEE
In this paper, we study the NP-hard delay-constrained least-cost path problem. A solution to this problem is needed to provide real-time communication service to connection-orient...
169
click to vote
IPL
2002
15 years 6 months ago
2002
One of the main reasons for using parallel evolutionary algorithms (PEAs) is to obtain efficient algorithms with an execution time much lower than that of their sequential counter...
158
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
Abstract--Space-Time Block Codes from square complex orthogonal designs (SCOD) have been extensively studied and most of the existing SCODs contain large number of zero. The zeros ...
129
click to vote
DATE
1997
IEEE
15 years 11 months ago
1997
IEEE
List scheduling algorithms attempt to minimize latency under resource constraints using a priority list. We propose a new heuristic that can be used in conjunction with any priori...
172
click to vote
EXPCS
2007
15 years 10 months ago
2007
In this paper, we introduce EXACT, the EXperimental Algorithmics Computational Toolkit. EXACT is a software framework for describing, controlling, and analyzing computer experimen...