4539 search results - page 157 / 908 » Approaches to Compute Workflow Complexity |
66
Voted
BIB
2010
14 years 10 months ago
2010
The inherent complexity of biomedical systems is well recognized; they are multi-scale, multi-science systems, bridging a wide range of temporal and spatial scales. This article r...
102
click to vote
KI
2009
Springer
15 years 4 months ago
2009
Springer
As a tractable description logic, DL-Lite provides a good compromise between expressive power and computational complexity of inference. It is therefore important to study ways of ...
GRC
2005
IEEE
15 years 3 months ago
2005
IEEE
An incremental target recognition algorithm based on improved discernibility matrix in rough set theory is presented. We compare the new approach with our previous nonincremental a...
86
Voted
LPNMR
1997
Springer
15 years 2 months ago
1997
Springer
We present a bottom-up algorithm for the computation of the well-founded model of non-disjunctive logic programs which is based on the set of elementary program transformations stu...
DLOG
2006
14 years 11 months ago
2006
We recently proposed action formalisms based on description logics (DLs) as decidable fragments of well-established action theories such as the Situation Calculus and the Fluent C...