187 search results - page 28 / 38 » Coloring linear orders with Rado's partial order |
ECOOP
1997
Springer
14 years 18 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...
ICPR
2010
IEEE
13 years 6 months ago
2010
IEEE
In this work a new method to retrieve images with similar lighting conditions is presented. It is based on automatic clustering and automatic indexing. Our proposal belongs to Con...
DCC
2007
IEEE
14 years 8 months ago
2007
IEEE
We introduce the notion of an unrefinable decomposition of a 1-design with at most two block intersection numbers, which is a certain decomposition of the 1-designs collection of ...
CONCUR
2007
Springer
14 years 2 months ago
2007
Springer
The notion of innocent strategy was introduced by Hyland and Ong in order to capture the interactive behaviour of λ-terms and PCF programs. An innocent strategy is defined as an ...
IJCAI
1997
13 years 9 months ago
1997
In tree search, depth-first search (DFS) often uses ordering successor heuristics. If the heuristic makes a mistake ordering a bad successor (without goals in its subtree) before ...