1688 search results - page 33 / 338 » The Complexity of Rationalizing Matchings |
STOC
1993
ACM
13 years 11 months ago
1993
ACM
Abstract. It is shown that high-order feedforward neural nets of constant depth with piecewisepolynomial activation functions and arbitrary real weights can be simulated for Boolea...
ATAL
2006
Springer
13 years 11 months ago
2006
Springer
In this paper we produce complexity and impossibility results and develop algorithms for a task allocation problem that needs to be solved by a group of autonomous agents working ...
BMCBI
2004
13 years 7 months ago
2004
Background: Protein-protein interactions play a critical role in protein function. Completion of many genomes is being followed rapidly by major efforts to identify interacting pr...
STOC
2005
ACM
14 years 8 months ago
2005
ACM
A celebrated 1976 theorem of Aumann asserts that honest, rational Bayesian agents with common priors will never "agree to disagree": if their opinions about any topic ar...
DAC
2005
ACM
14 years 8 months ago
2005
ACM
? An efficient and compact canonical form is proposed for the Boolean matching problem under permutation and complementation of variables. In addition an efficient algorithm for co...