4539 search results - page 508 / 908 » Approaches to Compute Workflow Complexity |
257
click to vote
ASPDAC
2005
ACM
15 years 8 months ago
2005
ACM
This paper proposes a novel O(n) Parallel Banker’s Algorithm (PBA) with a best-case run-time of O(1), reduced from an ¢¤£¦¥¨§© run-time complexity of the original Ban...
161
click to vote
IJCAI
2007
15 years 8 months ago
2007
Temporal reasoning is widely used within both Computer Science and A.I. However, the underlying complexity of temporal proof in discrete temporal logics has led to the use of simp...
199
click to vote
OPODIS
2007
15 years 8 months ago
2007
Abstract. Grid monitoring systems collect a substantial amount of information on the infrastructure’s status in order to perform various tasks, more commonly to provide a better ...
168
click to vote
IFIP13
2004
15 years 8 months ago
2004
: Function allocation, as a process used in the construction of dependable complex systems, is a significant aspect of the design and implementation of interactive systems. It invo...
204
click to vote
GECCO
2008
Springer
15 years 7 months ago
2008
Springer
In this work we present a new methodology for structure and parameter estimation in cell systems biology modelling. Our modelling framework is based on P systems, an unconl comput...