4797 search results - page 168 / 960 » The complexity of partition tasks |
178
click to vote
SCAI
2001
15 years 7 months ago
2001
We apply evolutionary algorithm (EA) to the design of controller for adaptive robots. EAs can be successful for more complicated tasks, where traditional engineering methods strugg...
183
click to vote
LCTRTS
2009
Springer
16 years 1 months ago
2009
Springer
The StreamIt programming model has been proposed to exploit parallelism in streaming applications on general purpose multicore architectures. The StreamIt graphs describe task, da...
164
click to vote
IESS
2007
Springer
16 years 16 days ago
2007
Springer
Abstract This paper presents an embedded system design toolchain for automatic generation of parallel code runnable on symmetric multiprocessor systems from an initial sequential s...
158
click to vote
FOCS
1997
IEEE
15 years 10 months ago
1997
IEEE
Abstract. We show how to associate e ectively computableobstructions to a waitfree distributed decision task (I;O; ) in the asynchronous shared-memory, readwrite model. The key new...
153
click to vote
ICIP
2001
IEEE
16 years 8 months ago
2001
IEEE
This paper proposes several low complexity algorithmic modifications to the SPIHT (Set Partitioning in Hierarchical Trees) image coding method of [3]. The modifications exploit un...