3 search results - page 1 / 1 » Fragmentary Pattern Matching: Complexity, Algorithms and App... |
ISAAC
2001
Springer
13 years 9 months ago
2001
Springer
A fragmentary pattern is a multiset of non-empty strings, and it matches a string w if all the strings in it occur within w without any overlaps. We study some fundamental issues o...
AAAI
2006
13 years 6 months ago
2006
While computers have defeated the best human players in many classic board games, progress in Go remains elusive. The large branching factor in the game makes traditional adversar...
ICAIL
2005
ACM
13 years 10 months ago
2005
ACM
Computational resources for research in legal environments have historically implied remote access to large databases of legal documents such as case law, statutes, law reviews an...