2899 search results - page 20 / 580 » On the Complexity of Exclusion Algorithms for Optimization |
107
click to vote
GECCO
2000
Springer
15 years 4 months ago
2000
Springer
This paper gives a theoretical and empirical analysis of the time complexity of genetic algorithms (GAs) on problems with exponentially scaled building blocks. It is important to ...
124
click to vote
ASPDAC
2005
ACM
15 years 3 months ago
2005
ACM
— Architecture Description Languages (ADLs) are widely used to perform design space exploration for Application Specific Instruction Set Processors (ASIPs). While the design spa...
118
click to vote
INFOCOM
1995
IEEE
15 years 4 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...
ICIP
2000
IEEE
16 years 2 months ago
2000
IEEE
In this paper, we study rate-complexity-distortion (R-C-D) tradeoffs for video coding, where we focus on the complexity of computing the inverse DCT. A quadtree coding approach is...
JETAI
2007
15 years 1 months ago
2007
The Internet has led to the development of on-line markets, and computer scientists have designed various auction algorithms, as well as automated exchanges for standardized commo...