1688 search results - page 6 / 338 » The Complexity of Rationalizing Matchings |
EPIA
1993
Springer
13 years 11 months ago
1993
Springer
Abstract. This work presents a constraint solver for the domain of rational trees. Since the problem is NP-hard the strategy used by the solver is to reduce as much as possible, in...
IAT
2008
IEEE
14 years 2 months ago
2008
IEEE
This paper presents an architecture for a memory model that facilitates versatile reasoning mechanisms over the beliefs stored in an agent’s belief base. Based on an approach fo...
ISSAC
2005
Springer
14 years 1 months ago
2005
Springer
Over the past few decades several variations on a “half GCD” algorithm for obtaining the pair of terms in the middle of a Euclidean sequence have been proposed. In the integer...
TCC
2010
Springer
14 years 4 months ago
2010
Springer
We study rationality in protocol design for the full-information model, a model characterized by computationally unbounded adversaries, no private communication, and no simultanei...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
We give a new, and hopefully more easily understandable, structural proof of the decomposition of a k-valued transducer into k unambiguous functional ones, a result established by...