Sciweavers

1088 search results - page 86 / 218
» A Bayesian Approach to Tackling Hard Computational Problems
Sort
View
GECCO
2008
Springer
238views Optimization» more  GECCO 2008»
13 years 11 months ago
Using multiple offspring sampling to guide genetic algorithms to solve permutation problems
The correct choice of an evolutionary algorithm, a genetic representation for the problem being solved (as well as their associated variation operators) and the appropriate values...
Antonio LaTorre, José Manuel Peña, V...
GECCO
2007
Springer
211views Optimization» more  GECCO 2007»
14 years 4 months ago
An extremal optimization search method for the protein folding problem: the go-model example
The protein folding problem consists of predicting the functional (native) structure of the protein given its linear sequence of amino acids. Despite extensive progress made in un...
Alena Shmygelska
WWW
2005
ACM
14 years 11 months ago
Accessibility: a Web engineering approach
Currently, the vast majority of web sites do not support accessibility for visually impaired users. Usually, these users have to rely on screen readers: applications that sequenti...
Peter Plessers, Sven Casteleyn, Yeliz Yesilada, Ol...
VRCAI
2004
ACM
14 years 3 months ago
Explorative construction of virtual worlds: an interactive kernel approach
Despite steady research advances in many aspects of virtual reality, building and testing virtual worlds remains to be a very difficult process. Most virtual environments are stil...
Jinseok Seo, Gerard Jounghyun Kim
AIIA
2009
Springer
14 years 3 months ago
Optimal Planning with ACO
In this paper a planning framework based on Ant Colony Optimization techniques is presented. Optimal planning is a very hard computational problem which has been coped with differe...
Marco Baioletti, Alfredo Milani, Valentina Poggion...