Sciweavers

485 search results - page 7 / 97
» Unconstraint Assignment Problem: A Molecular Computing Appro...
Sort
View
RECOMB
2006
Springer
14 years 8 months ago
A Parsimony Approach to Genome-Wide Ortholog Assignment
The assignment of orthologous genes between a pair of genomes is a fundamental and challenging problem in comparative genomics, since many computational methods for solving various...
Zheng Fu, Xin Chen, Vladimir Vacic, Peng Nan, Yang...
ISAAC
2004
Springer
103views Algorithms» more  ISAAC 2004»
14 years 1 months ago
Structural Similarity in Graphs (A Relaxation Approach for Role Assignment)
Standard methods for role assignment partition the vertex set of a graph in such a way that vertices in the same class can be considered to have equivalent roles in the graph. Seve...
Ulrik Brandes, Jürgen Lerner
TKDE
2008
118views more  TKDE 2008»
13 years 7 months ago
A Lagrangian Approach for Multiple Personalized Campaigns
The multicampaign assignment problem is a campaign model to overcome the multiple-recommendation problem that occurs when conducting several personalized campaigns simultaneously. ...
Yong-Hyuk Kim, Yourim Yoon, Byung Ro Moon
CAV
2012
Springer
227views Hardware» more  CAV 2012»
11 years 10 months ago
Minimum Satisfying Assignments for SMT
Abstract. A minimum satisfying assignment of a formula is a minimumcost partial assignment of values to the variables in the formula that guarantees the formula is true. Minimum sa...
Isil Dillig, Thomas Dillig, Kenneth L. McMillan, A...
GECCO
2005
Springer
189views Optimization» more  GECCO 2005»
14 years 1 months ago
Molecular programming: evolving genetic programs in a test tube
We present a molecular computing algorithm for evolving DNA-encoded genetic programs in a test tube. The use of synthetic DNA molecules combined with biochemical techniques for va...
Byoung-Tak Zhang, Ha-Young Jang