2526 search results - page 75 / 506 » A New Algorithm for Answer Set Computation |
STACS
2010
Springer
14 years 4 months ago
2010
Springer
We present a method for reducing the treewidth of a graph while preserving all the minimal s−t separators. This technique turns out to be very useful in the design of parameteriz...
ISAAC
2009
Springer
14 years 3 months ago
2009
Springer
Abstract. Set agreement is a fundamental problem in distributed computing in which processes collectively choose a small subset of values from a larger set of proposals. The imposs...
ICCVW
1999
Springer
14 years 1 months ago
1999
Springer
A new approach to characterizing the performance of point-correspondencealgorithmsis presented. Instead of relyingon any \ground truth', it uses the self-consistency of the o...
ICDM
2005
IEEE
14 years 2 months ago
2005
IEEE
In the information age, data is pervasive. In some applications, data explosion is a significant phenomenon. The massive data volume poses challenges to both human users and comp...
APPROX
2010
Springer
13 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...