4218 search results - page 282 / 844 » Complete sets of cooperations |
136
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
It is well-known that modal satisfiability is PSPACE-complete [Lad77]. However, the complexity may decrease if we restrict the set of propositional operators used. Note that there ...
178
click to vote
CSJM
2008
15 years 6 months ago
2008
A hybrid network of evolutionary processors (an HNEP) is a graph where each node is associated with an evolutionary processor (a special rewriting system), a set of words, an inpu...
161
click to vote
JAIR
2006
15 years 6 months ago
2006
Resolution is the rule of inference at the basis of most procedures for automated reasoning. In these procedures, the input formula is first translated into an equisatisfiable for...
161
click to vote
CN
2004
15 years 6 months ago
2004
This paper presents a probabilistic event-driven fault localization technique, which uses a probabilistic symptomfault map as a fault propagation model. The technique isolates the...
167
Voted
INFORMATICALT
1998
15 years 5 months ago
1998
Principles of the framework called time series forecasting automation are presented. It is required in processing massive temporal data sets and creating completely user-oriented f...