1310 search results - page 143 / 262 » A parallel genetic algorithm to solve the set-covering probl... |
CEC
2010
IEEE
14 years 1 months ago
2010
IEEE
— Adaptive Information Filtering seeks a solution to the problem of information overload through a tailored representation of the user’s interests, called user profile, which ...
ISPDC
2007
IEEE
15 years 4 months ago
2007
IEEE
Mixed-parallel applications can take advantage of largescale computing platforms but scheduling them efficiently on such platforms is challenging. In this paper we compare the tw...
IEEEHPCS
2010
14 years 8 months ago
2010
The problem of closed frequent itemset discovery is a fundamental problem of data mining, having applications in numerous domains. It is thus very important to have efficient par...
GECCO
2007
Springer
2007
Springer
Optimising the flow of experiments to a robot scientist with multi-objective evolutionary algorithms
15 years 4 months ago
A Robot Scientist is a physically implemented system that applies artificial intelligence to autonomously discover new knowledge through cycles of scientific experimentation. Ad...
CORR
2008
Springer
14 years 10 months ago
2008
Springer
Scheduling problems are generally NP-hard combinatorial problems, and a lot of research has been done to solve these problems heuristically. However, most of the previous approach...