2266 search results - page 445 / 454 » Evolutionary Algorithms for the Satisfiability Problem |
87
Voted
APPROX
2010
Springer
14 years 11 months ago
2010
Springer
Abstract. We study the fundamental problem of computing an arbitrary Nash equilibrium in bimatrix games. We start by proposing a novel characterization of the set of Nash equilibri...
113
click to vote
MVA
2000
14 years 10 months ago
2000
work, applies a nonlinear transformation from the input space to the hidden space. The output layer Partial face images, e.g.1 eyes, nose, and ear supplies the response of the netw...
IPM
2007
14 years 9 months ago
2007
We consider a network of autonomous peers forming a logically global but physically distributed search engine, where every peer has its own local collection generated by independe...
75
Voted
CPHYSICS
2004
14 years 9 months ago
2004
We introduce here a new method for the numerical resolution of the Vlasov equation on a phase space grid using an adaptive semi-Lagrangian method. The adaptivity is obtained throu...
CORR
2010
Springer
14 years 8 months ago
2010
Springer
Finding approximate Nash equilibria in n × n bimatrix games is currently one of the main open problems in algorithmic game theory. Motivated in part by the lack of progress on wo...