9284 search results - page 126 / 1857 » Knowledge State Algorithms |
120
click to vote
WIA
2004
Springer
15 years 10 months ago
2004
Springer
Finite automata determinization is a critical operation for numerous practical applications such as regular expression search. Algorithms have to deal with the possible blow up of ...
143
Voted
KR
1992
Springer
15 years 9 months ago
1992
Springer
I argue that an action-based model of belief update is largely compatible with the proposals advanced in the literature on formal approaches to discourse interpretation, especiall...
140
Voted
AAAI
1994
15 years 6 months ago
1994
So far, tractable planning problems reported in the literature have been defined by syntactical restrictions. To better exploit the inherent structure in problems, however, it is ...
141
click to vote
TNN
1998
15 years 4 months ago
1998
—Recurrent neural networks processing symbolic strings can be regarded as adaptive neural parsers. Given a set of positive and negative examples, picked up from a given language,...
278
click to vote
SIGMOD
2009
ACM
16 years 5 months ago
2009
ACM
Solid state drives perform random reads more than 100x faster than traditional magnetic hard disks, while offering comparable sequential read and write bandwidth. Because of their...