16404 search results - page 2505 / 3281 » A set coverage problem |
199
click to vote
FSKD
2009
Springer
16 years 2 months ago
2009
Springer
Usually a meaningful web topic has tens of thousands of comments, especially the hot topics. It is valuable if we congregate the comments into clusters and find out the mainstrea...
203
click to vote
FSTTCS
2009
Springer
16 years 2 months ago
2009
Springer
ABSTRACT. We consider concurrent systems that can be modelled as 1-safe Petri nets communicating through a fixed set of buffers (modelled as unbounded places). We identify a param...
201
click to vote
GECCO
2009
Springer
16 years 2 months ago
2009
Springer
The paper deals with optimization of collective communications on multistage interconnection networks (MINs). In the experimental work, unidirectional MINs like Omega, Butterfly a...
213
click to vote
GECCO
2009
Springer
16 years 2 months ago
2009
Springer
In this paper, we evaluate the performance of ten well-known evolutionary and non-evolutionary rule learning algorithms. The comparative study is performed on a real-world classi...
188
click to vote
GECCO
2009
Springer
16 years 2 months ago
2009
Springer
Bloat is a common problem with Evolutionary Algorithms (EAs) that use variable length representation. By creating unnecessarily large individuals it results in longer EA runtimes ...