4539 search results - page 47 / 908 » Approaches to Compute Workflow Complexity |
GRID
2005
Springer
15 years 3 months ago
2005
Springer
In this paper we describe the architecture and initial performance analysis results of the SERVOGrid Complexity Computational Environments (CCE). The CCE architecture is based on ...
TARK
2009
Springer
15 years 4 months ago
2009
Springer
The logical omniscience feature assumes that an epistemic agent knows all logical consequences of her assumptions. This paper offers a general theoretical framework that views log...
IEAAIE
1998
Springer
15 years 2 months ago
1998
Springer
Abstract. This paper has as main goal to develop a hybrid expert system to minimize some of the complexity problems related to arti cial intelligence eld. For instance, we can ment...
JC
2008
14 years 9 months ago
2008
In this paper we analyze the problem of adaptivity for one-step numerical methods for solving ODEs, both IVPs and BVPs, with a view to generating grids of minimal computational co...
IPPS
2003
IEEE
15 years 3 months ago
2003
IEEE
Planning is an artificial intelligence problem with a wide range of real-world applications. Genetic algorithms, neural networks, and simulated annealing are heuristic search met...