Sciweavers

18306 search results - page 101 / 3662
» Algorithmics in Exponential Time
Sort
View
RECOMB
2004
Springer
15 years 10 months ago
Structured motifs search
In this paper we describe an algorithm for the localization of structured models, i.e. sequences of (simple) motifs and distance constraints. It basically combines standard patter...
Alberto Policriti, Nicola Vitacolonna, Michele Mor...
ICASSP
2008
IEEE
15 years 4 months ago
Efficient computation of the binary vector that maximizes a rank-deficient quadratic form
The maximization of a full-rank quadratic form over a finite alphabet is NP-hard in both a worst-case sense and an average sense. Interestingly, if the rank of the form is not a ...
George N. Karystinos, Athanasios P. Liavas
CEC
2007
IEEE
15 years 4 months ago
Plateaus can be harder in multi-objective optimization
—In recent years a lot of progress has been made in understanding the behavior of evolutionary computation methods for single- and multi-objective problems. Our aim is to analyze...
Tobias Friedrich, Nils Hebbinghaus, Frank Neumann
CIA
2007
Springer
15 years 4 months ago
Who Works Together in Agent Coalition Formation?
Coalitions are often required for multi-agent collaboration. In this research, we consider tasks that can only be completed with the combined efforts of multiple agents using appro...
Vicki H. Allan, Kevin Westwood
GECCO
2004
Springer
15 years 3 months ago
Inducing Sequentiality Using Grammatical Genetic Codes
Abstract. This paper studies the inducement of sequentiality in genetic algorithms (GAs) for uniformly-scaled problems. Sequentiality is a phenomenon in which sub-solutions converg...
Kei Ohnishi, Kumara Sastry, Ying-Ping Chen, David ...