Sciweavers

1007 search results - page 112 / 202
» The Complexity of Futile Questioning
Sort
View
SOFSEM
2010
Springer
15 years 9 months ago
Lessons in Software Evolution Learned by Listening to Smalltalk
The biggest challenge facing software developers today is how to gracefully evolve complex software systems in the face of changing requirements. We clearly need software systems t...
Oscar Nierstrasz, Tudor Gîrba
STACS
2010
Springer
15 years 7 months ago
Quantum Algorithms for Testing Properties of Distributions
Abstract. Suppose one has access to oracles generating samples from two unknown probability distributions p and q on some N-element set. How many samples does one need to test whet...
Sergey Bravyi, Aram Wettroth Harrow, Avinatan Hass...
ACG
2009
Springer
15 years 7 months ago
Performance and Prediction: Bayesian Modelling of Fallible Choice in Chess
Evaluating agents in decision-making applications requires assessing their skill and predicting their behaviour. Both are well developed in Poker-like situations, but less so in mo...
Guy Haworth, Kenneth W. Regan, Giuseppe Di Fatta
123
Voted
SAT
2009
Springer
153views Hardware» more  SAT 2009»
15 years 7 months ago
Does Advice Help to Prove Propositional Tautologies?
One of the starting points of propositional proof complexity is the seminal paper by Cook and Reckhow [6], where they defined propositional proof systems as poly-time computable f...
Olaf Beyersdorff, Sebastian Müller
BROADNETS
2007
IEEE
15 years 7 months ago
Modeling and analysis of worm interactions (war of the worms)
—“War of the worms” is a war between opposing computer worms, creating complex worm interactions as well as detrimental impact on infrastructure. For example, in September 20...
Sapon Tanachaiwiwat, Ahmed Helmy