1615 search results - page 62 / 323 » Computer science and decision theory |
STACS
2005
Springer
14 years 2 months ago
2005
Springer
We define and study the complexity of robust polynomials for Boolean functions and the related fault-tolerant quantum decision trees, where input bits are perturbed by noise. We ...
ISIPTA
2003
IEEE
14 years 2 months ago
2003
IEEE
The nature of much information available to decision makers is vague and imprecise, be it information for human managers in organisations or for process agents in a distributed co...
KBSE
1995
IEEE
14 years 14 days ago
1995
IEEE
Cost-effective engineering and evolution of complex software must involve the different stakeholders concurrently and collaboratively. The hard problem is providing computer suppo...
BIRTHDAY
2010
Springer
13 years 10 months ago
2010
Springer
In this note we consider the following decision problems. Let be a fixed first-order signature. (i) Given a first-order theory or ground theory T over of Turing degree , a program...
ACMSE
2005
ACM
14 years 2 months ago
2005
ACM
Accurate identification of misuse is a key factor in determining appropriate ways to protect systems. Modern intrusion detection systems often use alerts from different sources su...