1092 search results - page 175 / 219 » Polynomial Interpretations and the Complexity of Algorithms |
TACAS
2007
Springer
15 years 8 months ago
2007
Springer
For specifying and verifying branching-time requirements, a reactive system is traditionally modeled as a labeled tree, where a path in the tree encodes a possible execution of the...
AAAI
1990
15 years 3 months ago
1990
Cyclic definitions are often prohibited in terminological knowledge representation languages because, from a theoretical point of view, their semantics is not clear and, from a pr...
CCGRID
2010
IEEE
15 years 3 months ago
2010
IEEE
With the increasing functionality and complexity of distributed systems, resource failures are inevitable. While numerous models and algorithms for dealing with failures exist, th...
112
click to vote
IJPRAI
2002
15 years 1 months ago
2002
Decision-tree algorithms are known to be unstable: small variations in the training set can result in different trees and different predictions for the same validation examples. B...
104
click to vote
KDD
2009
ACM
16 years 2 months ago
2009
ACM
Given multiple time sequences with missing values, we propose DynaMMo which summarizes, compresses, and finds latent variables. The idea is to discover hidden variables and learn ...