148 search results - page 5 / 30 » Exploiting Parallelism for Hard Problems in Abstract Argumen... |
CEC
2009
IEEE
14 years 5 days ago
2009
IEEE
Abstract— We propose an asynchronous island-model algorithm distribution framework and test the popular Differential Evolution algorithm performance when a few processors are ava...
IPPS
1996
IEEE
13 years 11 months ago
1996
IEEE
Many irregular scientific computing problems can be modeled by directed acyclic task graphs (DAGs). In this paper, we present an efficient run-time system for executing general as...
PPSN
2010
Springer
13 years 5 months ago
2010
Springer
Abstract. The rooted delay-constrained minimum spanning tree problem is an NP-hard combinatorial optimization problem arising for example in the design of centralized broadcasting ...
HPCC
2007
Springer
14 years 1 months ago
2007
Springer
Many of today’s embedded systems, such as wireless and portable devices rely heavily on the limited power supply. Therefore, energy efficiency becomes one of the major design con...
SEMCO
2009
IEEE
14 years 2 months ago
2009
IEEE
—This is a paper about a new resource, namely an English paraphrase dictionary extracted from the FrameNet lexicon and its example data base. I. THE LEXPAR PARAPHRASE DICTIONARY ...