1813 search results - page 197 / 363 » Instance Pruning Techniques |
170
click to vote
AI
2002
Springer
15 years 6 months ago
2002
Springer
This article surveys three techniques for enhancing heuristic game-tree search pioneered in the author's Othello program Logistello, which dominated the computer Othello scen...
176
click to vote
CORR
2010
Springer
15 years 5 months ago
2010
Springer
The safety of infinite state systems can be checked by a backward reachability procedure. For certain classes of systems, it is possible to prove the termination of the procedure ...
206
click to vote
SIGMOD
2010
ACM
15 years 4 months ago
2010
ACM
Given a graph database D and a query graph g, an exact subgraph matching query asks for the set S of graphs in D that contain g as a subgraph. This type of queries find important...
208
click to vote
ICDM
2010
IEEE
15 years 4 months ago
2010
IEEE
Many time series data mining problems require subsequence similarity search as a subroutine. While this can be performed with any distance measure, and dozens of distance measures ...
177
click to vote
OOPSLA
2010
Springer
15 years 4 months ago
2010
Springer
Glass box software model checking incorporates novel techniques to identify similarities in the state space of a model checker and safely prune large numbers of redundant states w...