4112 search results - page 88 / 823 » Efficient Algorithms for the Spoonerism Problem |
152
click to vote
ACIIDS
2012
IEEE
13 years 11 months ago
2012
IEEE
This paper proposes a new approach by combining the Evolutionary Algorithm and Imperialist Competitive Algorithm. This approach tries to capture several people involved in communit...
174
click to vote
ICDE
2009
IEEE
15 years 1 months ago
2009
IEEE
There is a huge wealth of sequence data available, for example, customer purchase histories, program execution traces, DNA, and protein sequences. Analyzing this wealth of data to ...
124
click to vote
GECCO
2006
Springer
15 years 7 months ago
2006
Springer
The population size in evolutionary computation is a significant parameter affecting computational effort and the ability to successfully evolve solutions. We find that population...
130
click to vote
CIAC
2010
Springer
15 years 7 months ago
2010
Springer
Various forms of multicut problems are of great importance in the area of network design. In general, these problems are intractable. However, several parameters have been identifi...
149
click to vote
SSDBM
2010
IEEE
15 years 1 months ago
2010
IEEE
Graphs are prevailingly used in many applications to model complex data structures. In this paper, we study the problem of supergraph containment search. To avoid the NP-complete s...