Sciweavers

293 search results - page 28 / 59
» New results on optimizing rooted triplets consistency
Sort
View
AAAI
2004
13 years 9 months ago
Study of Lower Bound Functions for MAX-2-SAT
Recently, several lower bound functions are proposed for solving the MAX-2-SAT problem optimally in a branch-and-bound algorithm. These lower bounds improve significantly the perf...
Haiou Shen, Hantao Zhang
GECCO
2004
Springer
150views Optimization» more  GECCO 2004»
14 years 28 days ago
Systems Biology Modeling in Human Genetics Using Petri Nets and Grammatical Evolution
Understanding the hierarchical relationships among biochemical, metabolic, and physiological systems in the mapping between genotype and phenotype is expected to improve the diagno...
Jason H. Moore, Lance W. Hahn
GECCO
2009
Springer
152views Optimization» more  GECCO 2009»
14 years 5 days ago
A data-based coding of candidate strings in the closest string problem
Given a set of strings S of equal lengths over an alphabet Σ, the closest string problem seeks a string over Σ whose maximum Hamming distance to any of the given strings is as s...
Bryant A. Julstrom
MSN
2005
Springer
14 years 1 months ago
Dual Binding Update with Additional Care of Address in Network Mobility
In this paper, we propose an end-to-end route optimization scheme for nested mobile networks, which we refer to as Dual Binding Update (DBU ). In general, the nested mobile network...
Kwang Chul Jeong, Tae-Jin Lee, Hyunseung Choo
CVPR
2009
IEEE
15 years 2 months ago
Higher-Order Clique Reduction in Binary Graph Cut
We introduce a new technique that can reduce any higher-order Markov random field with binary labels into a first-order one that has the same minima as the original. Moreover, w...
Hiroshi Ishikawa 0002