48 search results - page 5 / 10 » A characterization of the set of fixed points of the Quickso... |
APPROX
2010
Springer
13 years 8 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...
ICPR
2000
IEEE
14 years 7 months ago
2000
IEEE
We studied a number of measures that characterize the difficulty of a classification problem. We compared a set of real world problems to random combinations of points in this mea...
JNS
2008
13 years 6 months ago
2008
This paper studies the construction of geometric integrators for nonholonomic systems. We derive the nonholonomic discrete Euler-Lagrange equations in a setting which permits to de...
IJCAI
1997
13 years 8 months ago
1997
We address the problem of introducing preferences into default logic. Two approaches are given, one a generalisation of the other. In the first approach, an ordered default theory...
TSP
2008
13 years 6 months ago
2008
Markov random fields are designed to represent structured dependencies among large collections of random variables, and are well-suited to capture the structure of real-world sign...