Sciweavers

2174 search results - page 299 / 435
» On the Brittleness of Evolutionary Algorithms
Sort
View
GECCO
2008
Springer
168views Optimization» more  GECCO 2008»
15 years 7 months ago
Parameterizing pair approximations for takeover dynamics
Pair approximations have often been used to predict equilibrium conditions in spatially-explicit epidemiological and ecological systems. In this work, we investigate whether this ...
Joshua L. Payne, Margaret J. Eppstein
CONSTRAINTS
2002
143views more  CONSTRAINTS 2002»
15 years 6 months ago
A Constraint-Based Robotic Soccer Team
It is a challenging task for a team of multiple fast-moving robots to cooperate with each other and to compete with another team in a dynamic, real-time environment. For a robot te...
Yu Zhang, Alan K. Mackworth
SIAMCOMP
1998
111views more  SIAMCOMP 1998»
15 years 6 months ago
Computing the Local Consensus of Trees
The inference of consensus from a set of evolutionary trees is a fundamental problem in a number of fields such as biology and historical linguistics, and many models for inferrin...
Sampath Kannan, Tandy Warnow
NCA
2007
IEEE
15 years 6 months ago
Ensemble of hybrid neural network learning approaches for designing pharmaceutical drugs
Designing drugs is a current problem in the pharmaceutical research. By designing a drug we mean to choose some variables of drug formulation (inputs), for obtaining optimal charac...
Ajith Abraham, Crina Grosan, Stefan Tigan
IDEAL
2009
Springer
15 years 4 months ago
Optimizing Data Transformations for Classification Tasks
Many classification algorithms use the concept of distance or similarity between patterns. Previous work has shown that it is advantageous to optimize general Euclidean distances (...
José María Valls, Ricardo Aler