3049 search results - page 417 / 610 » On the Convergence of Bound Optimization Algorithms |
108
click to vote
GECCO
2007
Springer
15 years 10 months ago
2007
Springer
In a preliminary part of this paper, we analyze the necessity of randomness in evolution strategies. We conclude to the necessity of ”continuous”-randomness, but with a much m...
137
click to vote
GECCO
2005
Springer
15 years 10 months ago
2005
Springer
Self-adaptation of the mutation strengths is a powerful mechanism in evolution strategies (ES), but it can fail. As a consequence premature convergence or ending up in a local opt...
123
click to vote
ATAL
2004
Springer
15 years 10 months ago
2004
Springer
This paper presents an algorithm for learning the meaning of messages communicated between agents that interact while acting optimally towards a cooperative goal. Our reinforcemen...
137
click to vote
IMR
2003
Springer
15 years 9 months ago
2003
Springer
Finite element analysts and designers need to feel confident in the results of their analyses before sending a product to prototype or production. Mesh discretization can greatly ...
110
click to vote
ISPD
1999
ACM
15 years 8 months ago
1999
ACM
- In this paper, we present an algorithm for gate sizing with controlled displacement to improve the overall circuit timing. We use a path-based delay model to capture the timing c...