2316 search results - page 414 / 464 » The many forms of hypercomputation |
161
click to vote
LATA
2010
Springer
15 years 8 months ago
2010
Springer
Automated reasoning about systems with infinite domains requires an extension of regular automata to infinite alphabets. Existing formalisms of such automata cope with the infinite...
177
Voted
SAS
1994
Springer
15 years 8 months ago
1994
Springer
Amtoft has formulated an "on-line" constraint normalization method for solving a strictness inference problem inspired by Wright. From the syntactic form of the normaliz...
147
click to vote
VLDB
1994
ACM
15 years 8 months ago
1994
ACM
MapBase is a laboratory information system that has been supporting a high-throughput genome-mapping operation for the last three years. We chose to build MapBase around a C++-bas...
125
click to vote
CTCS
1989
Springer
15 years 8 months ago
1989
Springer
We introduce the notion of a candidate for “multiple valued universal constructions” and define stable functors (which generalise functors with left adjoints) in terms of fac...
216
click to vote
SIGIR
1992
ACM
15 years 8 months ago
1992
ACM
ct We describe work on the visualization of bibliographic data and, to aid in this task, the application of numerical techniques for multidimensional scaling. Many areas of scienti...