Sciweavers

797 search results - page 84 / 160
» Observing Success in the Pi-Calculus
Sort
View
GECCO
2004
Springer
147views Optimization» more  GECCO 2004»
15 years 3 months ago
A Demonstration of Neural Programming Applied to Non-Markovian Problems
Genetic programming may be seen as a recent incarnation of a long-held goal in evolutionary computation: to develop actual computational devices through evolutionary search. Geneti...
Gabriel Catalin Balan, Sean Luke
GECCO
2004
Springer
15 years 3 months ago
Improving the Performance of a Genetic Algorithm Using a Variable-Reordering Algorithm
Genetic algorithms have been successfully applied to many difficult problems but there have been some disappointing results as well. In these cases the choice of the internal repre...
Eduardo Rodriguez-Tello, Jose Torres-Jimenez
WABI
2004
Springer
116views Bioinformatics» more  WABI 2004»
15 years 3 months ago
Topological Rearrangements and Local Search Method for Tandem Duplication Trees
—The problem of reconstructing the duplication history of a set of tandemly repeated sequences was first introduced by Fitch [4]. Many recent studies deal with this problem, show...
Denis Bertrand, Olivier Gascuel
HICSS
2003
IEEE
95views Biometrics» more  HICSS 2003»
15 years 3 months ago
Matching Needs - Application Service Providing for Asynchronous Learning Networks
Universities have severe difficulties in using elearning applications successfully due to organizational problems to provide them. Providing a web-based learning environment is an...
Wolf-Gideon Bleek, Iver Jackewitz, Bernd Pape
INFOCOM
2003
IEEE
15 years 3 months ago
Routing for Network Capacity Maximization in Energy-constrained Ad-hoc Networks
— We present a new algorithm for routing of messages in ad-hoc networks where the nodes are energy-constrained. The routing objective is to maximize the total number of messages ...
Koushik Kar, Murali S. Kodialam, T. V. Lakshman, L...