Sciweavers

801 search results - page 93 / 161
» Computational intelligence in solving bioinformatics problem...
Sort
View
ICTAI
2000
IEEE
15 years 8 months ago
Building efficient partial plans using Markov decision processes
Markov Decision Processes (MDP) have been widely used as a framework for planning under uncertainty. They allow to compute optimal sequences of actions in order to achieve a given...
Pierre Laroche
EVOW
2009
Springer
15 years 11 months ago
A Memetic Algorithm for Phylogenetic Reconstruction with Maximum Parsimony
The Maximum Parsimony problem aims at reconstructing a phylogenetic tree from DNA, RNA or protein sequences while minimizing the number of evolutionary changes. Much work has been ...
Jean-Michel Richer, Adrien Goëffon, Jin-Kao H...
IEAAIE
2007
Springer
15 years 10 months ago
Phase-Based Feature Matching Under Illumination Variances
The problem of matching feature points in multiple images is difficult to solve when their appearance changes due to illumination variance, either by lighting or object motion. In ...
Masaaki Nishino, Atsuto Maki, Takashi Matsuyama
ATAL
2006
Springer
15 years 8 months ago
Examining DCSP coordination tradeoffs
Distributed Constraint Satisfaction Problems (DCSPs) provide a model to capture a broad range of cooperative multiagent problem solving settings. Researchers have generally propos...
Michael Benisch, Norman M. Sadeh
WABI
2009
Springer
127views Bioinformatics» more  WABI 2009»
15 years 11 months ago
Constructing Majority-Rule Supertrees
Background: Supertree methods combine the phylogenetic information from multiple partially-overlapping trees into a larger phylogenetic tree called a supertree. Several supertree ...
Jianrong Dong, David Fernández-Baca, Fred R...