Sciweavers

255 search results - page 12 / 51
» Learning parallel portfolios of algorithms
Sort
View
ISPASS
2009
IEEE
14 years 2 months ago
Machine learning based online performance prediction for runtime parallelization and task scheduling
—With the emerging many-core paradigm, parallel programming must extend beyond its traditional realm of scientific applications. Converting existing sequential applications as w...
Jiangtian Li, Xiaosong Ma, Karan Singh, Martin Sch...
ICS
2005
Tsinghua U.
14 years 28 days ago
What is worth learning from parallel workloads?: a user and session based analysis
Learning useful and predictable features from past workloads and exploiting them well is a major source of improvement in many operating system problems. We review known parallel ...
Julia Zilber, Ofer Amit, David Talby
CP
2004
Springer
14 years 24 days ago
Understanding Random SAT: Beyond the Clauses-to-Variables Ratio
It is well known that the ratio of the number of clauses to the number of variables in a random k-SAT instance is highly correlated with the instance’s empirical hardness. We con...
Eugene Nudelman, Kevin Leyton-Brown, Holger H. Hoo...
IJAIT
2007
69views more  IJAIT 2007»
13 years 7 months ago
A Psychogenetic Algorithm for Behavioral Sequence Learning
: This work presents an original algorithmic model of some essential features of psychogenetic theory, as was proposed by J.Piaget. Specifically, we modeled some elements of cognit...
Vittorio Maniezzo, Matteo Roffilli
ICML
2001
IEEE
14 years 8 months ago
Inducing Partially-Defined Instances with Evolutionary Algorithms
This paper addresses the issue of reducing the storage requirements on Instance-Based Learning algorithms. Algorithms proposed by other researches use heuristics to prune instance...
Josep Maria Garrell i Guiu, Xavier Llorà