4539 search results - page 263 / 908 » Approaches to Compute Workflow Complexity |
172
click to vote
IAT
2006
IEEE
16 years 19 days ago
2006
IEEE
In this paper, we propose a novel approach to solving the distributed constraint optimisation problem (DCOP) that guarantees completeness, while having linear communication comple...
139
click to vote
CDC
2009
IEEE
15 years 11 months ago
2009
IEEE
Abstract— For linear and hybrid systems, constrained timeoptimal control was shown to be a low complexity alternative to the explicit solution of the constrained finite-time-opt...
202
click to vote
CEC
2008
IEEE
16 years 1 months ago
2008
IEEE
—Much of the computational complexity in employing evolutionary algorithms as optimization tool is due to the fitness function evaluation that may either not exist or be computat...
177
click to vote
PERCOM
2005
ACM
16 years 6 months ago
2005
ACM
Pervasive computing environments offer a multitude of information services that provide potentially complex types of information. Therefore, when running access control for sensit...
168
click to vote
GECCO
2007
Springer
16 years 22 days ago
2007
Springer
This paper explores the application of the particle swarm algorithm for a NP-hard problem in the area of wireless communications. The specific problem is of detecting symbols in a...