1688 search results - page 118 / 338 » The Complexity of Rationalizing Matchings |
198
click to vote
SIAMCOMP
2011
15 years 22 days ago
2011
Set agreement, where processors decisions constitute a set of outputs, is notoriously harder to analyze than consensus where the decisions are restricted to a single output. This ...
292
click to vote
ICANN
2011
Springer
14 years 9 months ago
2011
Springer
The definition of appropriate kernel functions is crucial for the performance of a kernel method. In many of the state-of-the-art kernels for trees, matching substructures are con...
151
click to vote
STOC
2010
ACM
16 years 3 months ago
2010
ACM
In this paper we study the computational complexity of computing the noncommutative determinant. We first consider the arithmetic circuit complexity of computing the noncommutativ...
160
click to vote
CSL
2009
Springer
16 years 10 days ago
2009
Springer
Abstract. One-counter processes are pushdown processes over a singleton stack alphabet (plus a stack-bottom symbol). We study the problems of model checking asynchronous products o...
179
click to vote
MATES
2009
Springer
16 years 9 days ago
2009
Springer
Abstract. Taxonomies in the area of Multi-Agent Systems (MAS) classify problems according to the underlying principles and assumptions of the agents’ abilities, rationality and i...