1290 search results - page 12 / 258 » New algorithms of the Q-learning type |
FOCS
1992
IEEE
14 years 20 days ago
1992
IEEE
Partial types for the -calculus were introduced by Thatte in 1988 [3] as a means of typing objects that are not typable with simple types, such as heterogeneous lists and persiste...
LICS
1997
IEEE
14 years 23 days ago
1997
IEEE
A subtyping 0 is entailed by a set of subtyping constraints C, written C j= 0, if every valuation (mapping of type variables to ground types) that satisfies C also satisfies 0. ...
FPGA
2003
ACM
14 years 1 months ago
2003
ACM
The routing channels of an FPGA consist of wire segments of various types providing the tradeoff between performance and routability. In the routing architectures of recently dev...
ECOOP
1997
Springer
14 years 22 days ago
1997
Springer
A type inclusion test is a procedure to decide whether two types are related by a given subtyping relationship. An efficient implementation of the type inclusion test plays an impo...
ASIAN
2006
Springer
14 years 9 days ago
2006
Springer
Interesting properties of programs can be expressed using contextual equivalence. The latter is difficult to prove directly, hence (pre-)logical relations are often used as a tool ...