2095 search results - page 205 / 419 » Improved pebbling bounds |
162
click to vote
SIAMDM
1998
15 years 6 months ago
1998
In this paper we present and describe an improved version of the Zero-Neighbors algorithm, which we call the Zero-Coverings algorithm. We also present a method for finding a small...
156
click to vote
CORR
2009
Springer
15 years 4 months ago
2009
Springer
The minimal deterministic finite automaton is generally used to determine regular languages equality. Using Brzozowski's notion of derivative, Antimirov and Mosses proposed a...
177
click to vote
IMCSIT
2010
15 years 3 months ago
2010
The paper presents an extended version of the SuperMatrix system -- a general tool supporting automatic acquisition of lexical semantic relations from corpora. Extensions focus mai...
193
click to vote
TCIAIG
2010
15 years 1 months ago
2010
Monte-Carlo tree search has recently been very successful for game playing particularly for games where the evaluation of a state is difficult to compute, such as Go or General Gam...
184
click to vote
TCS
2010
15 years 1 months ago
2010
The theorem of factorization forests of Imre Simon shows the existence of nested factorizations -- `a la Ramsey -- for finite words. This theorem has important applications in sem...