2016 search results - page 222 / 404 » Megamaps: Construction and Examples |
170
Voted
CTCS
1989
Springer
15 years 10 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...
184
click to vote
FOCS
1990
IEEE
15 years 10 months ago
1990
IEEE
Two of the most commonly used models in computational learning theory are the distribution-free model in which examples are chosen from a fixed but arbitrary distribution, and the ...
150
click to vote
LPNMR
1990
Springer
15 years 10 months ago
1990
Springer
We present a general theory for the use of negative premises in the rules of Transition System Specifications (TSSs). We formulate a criterion that should be satisfied by a TSS in ...
191
click to vote
AOSD
2007
ACM
15 years 10 months ago
2007
ACM
We define and study bisimulation for proving contextual equivalence in an aspect extension of the untyped lambda-calculus. To our knowledge, this is the first study of coinductive...
199
click to vote
ICCBR
1995
Springer
15 years 10 months ago
1995
Springer
There have been several e orts to create and use real maps in computer applications that automatically nd good map routes. In general, online map representations do not include in...