10988 search results - page 247 / 2198 » Algorithmic Folding Complexity |
155
click to vote
DNA
2005
Springer
16 years 4 days ago
2005
Springer
Abstract. Fault-tolerance is a critical issue for biochemical computation. Recent theoretical work on algorithmic self-assembly has shown that error correcting tile sets are possib...
157
click to vote
GECCO
2005
Springer
16 years 4 days ago
2005
Springer
Checking if microprocessor cores are fully functional at the end of the productive process has become a major issue. Traditional functional approaches are not sufficient when cons...
169
click to vote
COCO
2004
Springer
16 years 6 hour ago
2004
Springer
We prove a parameterized analog of Schaefer’s Dichotomy Theorem: we show that for every finite boolean constraint family F, deciding whether a formula containing constraints fr...
149
click to vote
ISCAS
2003
IEEE
15 years 12 months ago
2003
IEEE
High frequency digital LSIs usually consist of many subcircuits coupled with multi-conductor interconnects embedded in the substrate. They sometimes cause serious problems of the ...
157
click to vote
FCT
2003
Springer
15 years 11 months ago
2003
Springer
The closest substring problem, where a short string is sought that minimizes the number of mismatches between it and each of a given set of strings, is a minimization problem with ...