2656 search results - page 41 / 532 » Design and analysis of algorithms reconsidered |
153
click to vote
PPOPP
1999
ACM
15 years 8 months ago
1999
ACM
Divide and conquer algorithms are a good match for modern parallel machines: they tend to have large amounts of inherent parallelism and they work well with caches and deep memory...
128
click to vote
GECCO
2003
Springer
15 years 9 months ago
2003
Springer
In this paper, a new model of Probabilistic Model-Building Genetic Algorithms (PMBGAs), Distributed PMBGA (DPMBGA), is proposed. In the DPMBGA, the correlation among the design var...
115
click to vote
DAC
2005
ACM
15 years 6 months ago
2005
ACM
Traditional corner analysis fails to guarantee a target yield for a given performance metric. However, recently proposed solutions, in the form of statistical timing analysis, whi...
145
click to vote
AIPS
1994
15 years 5 months ago
1994
Despite the long history of classical planning, there has been very little comparative analysis of the performance tradeoffs offered by the multitude of existing planning algorith...
153
click to vote
ECCV
2000
Springer
16 years 6 months ago
2000
Springer
This paper focuses on matching 1D structures by variational methods. We provide rigorous rules for the construction of the cost function, on the basis of an analysis of properties ...