Sciweavers

438 search results - page 61 / 88
» New Search Heuristics for Max-CSP
Sort
View
CP
2007
Springer
15 years 4 months ago
Exploiting Past and Future: Pruning by Inconsistent Partial State Dominance
It has recently been shown, for the Constraint Satisfaction Problem (CSP), that the state associated with a node of the search tree built by a backtracking algorithm can be exploit...
Christophe Lecoutre, Lakhdar Sais, Sébastie...
ISMB
2004
14 years 11 months ago
Exploiting conserved structure for faster annotation of non-coding RNAs without loss of accuracy
Motivation: Non-coding RNAs (ncRNAs)--functional RNA molecules not coding for proteins--are grouped into hundreds of families of homologs. To find new members of an ncRNA gene fam...
Zasha Weinberg, Walter L. Ruzzo
AI
2008
Springer
14 years 10 months ago
An approach to efficient planning with numerical fluents and multi-criteria plan quality
Dealing with numerical information is practically important in many real-world planning domains where the executability of an action can depend on certain numerical conditions, an...
Alfonso Gerevini, Alessandro Saetti, Ivan Serina
BICOB
2009
Springer
15 years 4 months ago
A Fitness Distance Correlation Measure for Evolutionary Trees
Phylogenetics is concerned with inferring the genealogical relationships between a group of organisms (or taxa), and this relationship is usually expressed as an evolutionary tree....
Hyun Jung Park, Tiffani L. Williams
GECCO
2007
Springer
158views Optimization» more  GECCO 2007»
15 years 4 months ago
A leader-based parallel cross entropy algorithm for MCP
The Cross Entropy algorithm is a new search method for combinatorial problem. However, it needs considerable computational time to achieve good solution quality. To make the Cross...
Zhanhua Bai, Qiang Lv