Sciweavers

2526 search results - page 14 / 506
» A New Algorithm for Answer Set Computation
Sort
View
FOCS
2009
IEEE
14 years 3 months ago
Regularity Lemmas and Combinatorial Algorithms
— We present new combinatorial algorithms for Boolean matrix multiplication (BMM) and preprocessing a graph to answer independent set queries. We give the first asymptotic impro...
Nikhil Bansal, Ryan Williams
BMCBI
2010
110views more  BMCBI 2010»
13 years 9 months ago
Discovering local patterns of co - evolution: computational aspects and biological examples
Background: Co-evolution is the process in which two (or more) sets of orthologs exhibit a similar or correlative pattern of evolution. Co-evolution is a powerful way to learn abo...
Tamir Tuller, Yifat Felder, Martin Kupiec
ACL
2010
13 years 7 months ago
Optimizing Question Answering Accuracy by Maximizing Log-Likelihood
In this paper we demonstrate that there is a strong correlation between the Question Answering (QA) accuracy and the log-likelihood of the answer typing component of our statistic...
Matthias H. Heie, Edward W. D. Whittaker, Sadaoki ...
IWPEC
2010
Springer
13 years 7 months ago
Inclusion/Exclusion Branching for Partial Dominating Set and Set Splitting
Abstract. Inclusion/exclusion branching is a way to branch on requirements imposed on problems, in contrast to the classical branching on parts of the solution. The technique turne...
Jesper Nederlof, Johan M. M. van Rooij
IJCAI
2003
13 years 10 months ago
Taming Decentralized POMDPs: Towards Efficient Policy Computation for Multiagent Settings
The problem of deriving joint policies for a group of agents that maximize some joint reward function can be modeled as a decentralized partially observable Markov decision proces...
Ranjit Nair, Milind Tambe, Makoto Yokoo, David V. ...