1033 search results - page 53 / 207 » The Relative History Heuristic |
IANDC
2006
14 years 12 months ago
2006
We study three operational models of name-passing process calculi: coalgebras on (pre)sheaves, indexed labelled transition systems, and history dependent automata. The coalgebraic...
RP
2009
Springer
15 years 6 months ago
2009
Springer
We describe the class of games with opacity condition, as an adequate model for security aspects of computing systems. We study their theoretical properties, relate them to reachab...
100
click to vote
AI
2004
Springer
15 years 5 months ago
2004
Springer
Abstract. We present a new hybrid constraint solving schema which retains some systematicity of constructive search while incorporating the heuristic guidance and lack of commitmen...
101
click to vote
CCCG
2007
15 years 1 months ago
2007
We present a heuristic algorithm to compute approximate geodesic distances on a triangular manifold S containing n vertices with partially missing data. The proposed method comput...
AAAI
1998
15 years 1 months ago
1998
Automatedreasoning or theorem proving essentially amounts to solving search problems. Despite significant progress in recent years theorem provers still have manyshortcomings. The...