400 search results - page 13 / 80 » On some Properties of DNA Graphs |
143
click to vote
DNA
2005
Springer
15 years 11 months 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...
163
click to vote
STOC
2000
ACM
15 years 10 months ago
2000
ACM
We propose a random graph model which is a special case of sparse random graphs with given degree sequences. This model involves only a small number of parameters, called logsize ...
152
click to vote
ATAL
2003
Springer
15 years 11 months ago
2003
Springer
Agents must decide with whom to interact, which is nontrivial when no central directories are available. A classical decentralized approach is referral systems, where agents adapt...
167
click to vote
EKAW
2006
Springer
15 years 8 months ago
2006
Springer
Abstract. Qualitative reasoning uses a limited set of relevant distinctions of the domain to allow a flexible way of representing and reasoning about it. This work presents a conce...
176
click to vote
EJC
2007
15 years 5 months ago
2007
We construct algorithms for deciding essentially any minor-closed parameter, with explicit time bounds. This result strengthens previous results by Robertson and Seymour [1,2], Fr...