3455 search results - page 162 / 691 » Generalized Game Trees |
164
click to vote
AIML
2006
15 years 7 months ago
2006
We survey a number of decidablity and undecidablity results concerning epistemic temporal logic. The goal is to provide a general picture which will facilitate the `sharing of idea...
196
click to vote
KDD
2008
ACM
16 years 6 months ago
2008
ACM
Closed patterns are powerful representatives of frequent patterns, since they eliminate redundant information. We propose a new approach for mining closed unlabeled rooted trees a...
180
click to vote
WADS
2005
Springer
15 years 12 months ago
2005
Springer
Spatial databases support a variety of geometric queries on point data such as range searches, nearest neighbor searches, etc. Balanced Aspect Ratio (BAR) trees are hierarchical sp...
165
click to vote
CSL
2007
Springer
16 years 19 days ago
2007
Springer
Normal form bisimulation is a powerful theory of program equivalence, originally developed to characterize L´evy-Longo tree equivalence and Boehm tree equivalence. It has been ada...
137
click to vote
ACG
2006
Springer
16 years 14 days ago
2006
Springer
A plethora of enhancements are available to be used together with the αβ search algorithm. There are so many, that their selection and implementation is a non-trivial task, even ...