11716 search results - page 172 / 2344 » Computable symbolic dynamics |
170
click to vote
ICDAR
2005
IEEE
16 years 2 days ago
2005
IEEE
A trainable method for distinguishing between mathematics notation and natural language (here, English) in images of textlines, using computational geometry methods only with no a...
153
click to vote
ACTA
2005
15 years 6 months ago
2005
A hybrid network of evolutionary processors (an HNEP) consists of several language processors which are located in the nodes of a virtual graph and able to perform only one type o...
176
click to vote
ENTCS
2011
15 years 1 months ago
2011
SUBSEXPL is a system originally developed to visualise reductions, simplifications and normalisations in three important calculi of explicit substitutions and has been applied to...
194
click to vote
FMCAD
2004
Springer
15 years 12 months ago
2004
Springer
Most symbolic model checkers are based on either Binary Decision Diagrams (BDDs), which may grow exponentially large, or Satisfiability (SAT) solvers, whose time requirements rapi...
199
click to vote
LPNMR
1997
Springer
15 years 10 months ago
1997
Springer
Turi [20] introduced the important notion of a constrained atom: an atom with associated equality and disequality constraints on its arguments. A set of constrained atoms is a cons...