454 search results - page 21 / 91 » On improving approximate solutions by evolutionary algorithm... |
155
click to vote
GECCO
2010
Springer
15 years 6 months ago
2010
Springer
This paper proposes an integrated approach to arrive at optimal build orientations, simultaneously minimizing surface roughness ‘Ra’ and build time ‘T’, for object manufac...
112
click to vote
WINE
2007
Springer
15 years 7 months ago
2007
Springer
Abstract. We consider the problem of computing additively approximate Nash equilibria in non-cooperative two-player games. We provide a new polynomial time algorithm that achieves ...
111
click to vote
IPCO
1993
15 years 2 months ago
1993
The survivable network design problem (SNDP) is to construct a minimum-cost subgraph satisfying certain given edge-connectivity requirements. The first polynomial-time approximati...
107
click to vote
RSCTC
2000
Springer
15 years 5 months ago
2000
Springer
Abstract. Classic parsing methods are based on complete search techniques to find the different interpretations of a sentence. However, the size of the search space increases expon...
115
click to vote
IJCAI
2007
15 years 2 months ago
2007
Planning in partially-observable dynamical systems (such as POMDPs and PSRs) is a computationally challenging task. Popular approximation techniques that have proved successful ar...