218 search results - page 15 / 44 » A Theory of Mean Field Approximation |
COMPGEOM
1995
ACM
15 years 1 months ago
1995
ACM
The range searching problem is a fundamental problem in computational geometry, with numerous important applications. Most research has focused on solving this problem exactly, bu...
ADC
2004
Springer
15 years 3 months ago
2004
Springer
Reflective Relational Machines were introduced by S. Abiteboul, C. Papadimitriou and V. Vianu in 1994, as variations of Turing machines which are suitable for the computation of ...
TALG
2010
14 years 8 months ago
2010
Fractional hypertree width is a hypergraph measure similar to tree width and hypertree width. Its algorithmic importance comes from the fact that, as shown in previous work [14], ...
RSEISP
2007
Springer
15 years 4 months ago
2007
Springer
Most information about the external world comes from our visual brain. However, it is not clear how this information is processed. We will analyze brain responses using machine lea...
102
click to vote
SAGT
2010
Springer
14 years 8 months ago
2010
Springer
Abstract. One reason for wanting to compute an (approximate) Nash equilibrium of a game is to predict how players will play. However, if the game has multiple equilibria that are f...