805 search results - page 150 / 161 » Combinatorial optimization problems in self-assembly |
137
Voted
CP
2009
Springer
15 years 1 months ago
2009
Springer
Abstract. Lazy clause generation is a powerful hybrid approach to combinatorial optimization that combines features from SAT solving and finite domain (FD) propagation. In lazy cla...
130
Voted
IPPS
2005
IEEE
15 years 9 months ago
2005
IEEE
FROST (Fold Recognition-Oriented Search Tool) [6] is a software whose purpose is to assign a 3D structure to a protein sequence. It is based on a series of filters and uses a dat...
132
Voted
CIKM
2008
Springer
15 years 5 months ago
2008
Springer
Many applications on blog search and mining often meet the challenge of handling huge volume of blog data, in which one single blog could contain hundreds or even thousands of ent...
133
Voted
SODA
2008
ACM
15 years 5 months ago
2008
ACM
We prove that binary linear concatenated codes with an outer algebraic code (specifically, a folded Reed-Solomon code) and independently and randomly chosen linear inner codes ach...
156
Voted
CJ
2006
15 years 3 months ago
2006
Anonymous channels or similar techniques that can achieve sender's anonymity play important roles in many applications. However, they will be meaningless if cryptographic prim...