3690 search results - page 63 / 738 » Computation with classical sequents |
AISC
2004
Springer
15 years 3 months ago
2004
Springer
Symmetry-breaking in constraint satisfaction problems (CSPs) is a well-established area of AI research which has recently developed strong interactions with symbolic computation, i...
GBRPR
2009
Springer
15 years 2 months ago
2009
Springer
The median graph has been shown to be a good choice to infer a representative of a set of graphs. It has been successfully applied to graph-based classification and clustering. Ne...
RTA
2010
Springer
15 years 1 months ago
2010
Springer
In earlier work, we have shown that for confluent term rewrite systems (TRSs for short), innermost polynomial runtime complexity induces polytime computability of the functions de...
EUROPAR
2006
Springer
15 years 1 months ago
2006
Springer
Parallel performance tuning naturally involves a diagnosis process to locate and explain sources of program inefficiency. Proposed is an approach that exploits parallel computation...
FPLAY
2008
14 years 11 months ago
2008
In this paper, we describe a cumulative context computer game, where accumulated contextual information of the players activity levels, obtained through mobile sensors, is used to...