3946 search results - page 163 / 790 » The computational complexity of choice sets |
164
click to vote
IJON
2007
15 years 6 months ago
2007
Over the course of the first few months of life, our brains accomplish a remarkable feat. They are able to interpret complex visual images so that instead of being just disconnec...
210
click to vote
BMCBI
2011
15 years 1 months ago
2011
Background: The Monte Carlo simulation of sequence evolution is routinely used to assess the performance of phylogenetic inference methods and sequence alignment algorithms. Progr...
221
click to vote
AAAI
2012
13 years 9 months ago
2012
This paper addresses the problem of automated advice provision in settings that involve repeated interactions between people and computer agents. This problem arises in many real ...
173
click to vote
ICALP
2007
Springer
16 years 22 days ago
2007
Springer
d Abstract) Paul Beame1, , Matei David2, , Toniann Pitassi2, , and Philipp Woelfel2,† 1 University of Washington 2 University of Toronto Abstract. We solve some fundamental probl...
144
click to vote
LICS
2008
IEEE
16 years 29 days ago
2008
IEEE
We show that the asymptotic complexity of uniformly generated (expressible in First-Order (FO) logic) propositional tautologies for the Nullstellensatz proof system (NS) as well a...