75 search results - page 11 / 15 » Using DNA to solve the Bounded Post Correspondence Problem |
COMPGEOM
2010
ACM
14 years 13 days ago
2010
ACM
Let D be a weighted directed graph cellularly embedded in a surface of genus g, orientable or not, possibly with boundary. We describe algorithms to compute a shortest non-contrac...
CP
1997
Springer
13 years 11 months ago
1997
Springer
Feature trees have been used to accommodate records in constraint programming and record like structures in computational linguistics. Feature trees model records, and feature cons...
SAC
2011
ACM
12 years 10 months ago
2011
ACM
Although the Web lets users freely browse and publish information, most Web information is unauthorized in contrast to conventional mass media. Therefore, it is not always credibl...
ISTCS
1993
Springer
13 years 11 months ago
1993
Springer
We pursue a particular approach to analog computation, based on dynamical systems of the type used in neural networks research. Our systems have a xed structure, invariant in time...
IJAR
2008
13 years 7 months ago
2008
As is well-known, residuated lattices (RLs) on the unit interval correspond to leftcontinuous t-norms. Thus far, a similar characterization has not been found for RLs on the set o...