Sciweavers

148 search results - page 4 / 30
» Exploiting Parallelism for Hard Problems in Abstract Argumen...
Sort
View
GECCO
2007
Springer
151views Optimization» more  GECCO 2007»
14 years 1 months ago
Solving real-valued optimisation problems using cartesian genetic programming
Classical Evolutionary Programming (CEP) and Fast Evolutionary Programming (FEP) have been applied to realvalued function optimisation. Both of these techniques directly evolve th...
James Alfred Walker, Julian Francis Miller
CONCUR
2006
Springer
13 years 11 months ago
Weak Bisimulation Up to Elaboration
Abstract We study the use of the elaboration preorder (due to ArunKumar and Natarajan) in the framework of up-to techniques for weak bisimulation. We show that elaboration yields a...
Damien Pous
CASES
2008
ACM
13 years 9 months ago
SoC-C: efficient programming abstractions for heterogeneous multicore systems on chip
fficient Programming Abstractions for Heterogeneous Multicore Systems on Chip Alastair D. Reid Krisztian Flautner Edmund Grimley-Evans ARM Ltd Yuan Lin University of Michigan The ...
Alastair D. Reid, Krisztián Flautner, Edmun...
IWOCA
2009
Springer
152views Algorithms» more  IWOCA 2009»
14 years 2 months ago
Better Polynomial Algorithms on Graphs of Bounded Rank-Width
Abstract. Although there exist many polynomial algorithms for NPhard problems running on a bounded clique-width expression of the input graph, there exists only little comparable w...
Robert Ganian, Petr Hlinený
CCGRID
2007
IEEE
14 years 1 months ago
Exploiting Heterogeneity for Collective Data Downloading in Volunteer-based Networks
Abstract— Scientific computing is being increasingly deployed over volunteer-based distributed computing environments consisting of idle resources on donated user machines. A fu...
Jinoh Kim, Abhishek Chandra, Jon B. Weissman