2477 search results - page 93 / 496 » Parallelizing Functional Programs by Generalization |
ICLP
2007
Springer
15 years 1 months ago
2007
Springer
We present a static analysis that infers both upper and lower bounds on the usage that a logic program makes of a set of user-definable resources. The inferred bounds will in gener...
EUROPAR
2001
Springer
15 years 2 months ago
2001
Springer
We present a new result concerning the parallelisation of DBSCAN, a Data Mining algorithm for density-based spatial clustering. The overall structure of DBSCAN has been mapped to a...
GECCO
2005
Springer
15 years 3 months ago
2005
Springer
In this paper, a new hybrid of genetic algorithm (GA) and simulated annealing (SA), referred to as GSA, is presented. In this algorithm, SA is incorporated into GA to escape from ...
123
click to vote
JMLR
2010
14 years 4 months ago
2010
With the goal to generate more scalable algorithms with higher efficiency and fewer open parameters, reinforcement learning (RL) has recently moved towards combining classical tec...
117
click to vote
BMCBI
2011
14 years 4 months ago
2011
Background: Bioinformatic analyses typically proceed as chains of data-processing tasks. A pipeline, or ‘workflow’, is a well-defined protocol, with a specific structure defin...