Sciweavers

3136 search results - page 332 / 628
» Complex networks and evolutionary computation
Sort
View
RECOMB
2006
Springer
16 years 7 months ago
Efficient Enumeration of Phylogenetically Informative Substrings
We study the problem of enumerating substrings that are common amongst genomes that share evolutionary descent. For example, one might want to enumerate all identical (therefore co...
Stanislav Angelov, Boulos Harb, Sampath Kannan, Sa...
GECCO
2007
Springer
183views Optimization» more  GECCO 2007»
16 years 27 days ago
Screening the parameters affecting heuristic performance
This research screens the tuning parameters of a combinatorial optimization heuristic. Specifically, it presents a Design of Experiments (DOE) approach that uses a Fractional Fac...
Enda Ridge, Daniel Kudenko
GECCO
2007
Springer
192views Optimization» more  GECCO 2007»
16 years 27 days ago
On the runtime analysis of the 1-ANT ACO algorithm
The runtime analysis of randomized search heuristics is a growing field where, in the last two decades, many rigorous results have been obtained. These results, however, apply pa...
Benjamin Doerr, Frank Neumann, Dirk Sudholt, Carst...
MM
2004
ACM
149views Multimedia» more  MM 2004»
16 years 4 days ago
Designing experiential environments for management of personal multimedia
With the increasing ubiquity of sensors and computational resources, it is becoming easier and increasingly common for people to electronically record, photographs, text, audio, a...
Rahul Singh, Rachel Knickmeyer, Punit Gupta, Rames...
GECCO
2003
Springer
112views Optimization» more  GECCO 2003»
15 years 12 months ago
Limits in Long Path Learning with XCS
The development of the XCS Learning Classifier System [26] has produced a stable implementation, able to consistently identify the accurate and optimally general population of cla...
Alwyn Barry