514 search results - page 38 / 103 » On the Structure of Valiant's Complexity Classes |
STOC
2009
ACM
14 years 9 months ago
2009
ACM
Non-relativization of complexity issues can be interpreted as giving some evidence that these issues cannot be resolved by "black-box" techniques. In the early 1990'...
LOGCOM
2007
13 years 8 months ago
2007
In Artificial Intelligence there is a need for reasoning about continuous processes, where assertions refer to time intervals rather than time points. Taking our lead from van Ben...
JOT
2006
13 years 8 months ago
2006
In this paper, it is suggested an approach and a design pattern for developing object-oriented models that need to be persistent, including the databases of moderate size, with us...
UAI
1997
13 years 10 months ago
1997
Bayesian networks provide a modeling language and associated inference algorithm for stochastic domains. They have been successfully applied in a variety of medium-scale applicati...
ISORC
1999
IEEE
14 years 28 days ago
1999
IEEE
To analyze the complexity of object-oriented software, several metrics have been proposed. Among them, Chidamber and Kemerer's metrics are well-known ones as object-oriented ...