Sciweavers

3653 search results - page 209 / 731
» Learning of Partial Languages
Sort
View
NLPRS
2001
Springer
15 years 8 months ago
Incremental CFG Parsing with Statistical Lexical Dependencies
Incremental parsing with a context free grammar produces partial syntactic structures for an initial fragment on the word-by-word basis. Owing to the syntactic ambiguity, however,...
Takahisa Murase, Shigeki Matsubara, Yoshihide Kato...
165
Voted
ECOOP
1998
Springer
15 years 8 months ago
Cyclic Distributed Garbage Collection with Group Merger
This paper presents a new algorithm for distributed garbage collection and outlines its implementation within the Network Objects system. The algorithm is based on a reference list...
Helena Rodrigues, Richard E. Jones
ICALP
1998
Springer
15 years 8 months ago
Efficient Approximation Algorithms for the Subset-Sums Equality Problem
We investigate the problem of finding two nonempty disjoint subsets of a set of n positive integers, with the objective that the sums of the numbers in the two subsets be as close ...
Cristina Bazgan, Miklos Santha, Zsolt Tuza
CICLING
2008
Springer
15 years 5 months ago
Unsupervised and Knowledge-Free Learning of Compound Splits and Periphrases
Abstract. We present an approach for knowledge-free and unsupervised recognition of compound nouns for languages that use one-wordcompounds such as Germanic and Scandinavian langua...
Florian Holz, Chris Biemann
AIIDE
2008
15 years 6 months ago
Agent Learning using Action-Dependent Learning Rates in Computer Role-Playing Games
We introduce the ALeRT (Action-dependent Learning Rates with Trends) algorithm that makes two modifications to the learning rate and one change to the exploration rate of traditio...
Maria Cutumisu, Duane Szafron, Michael H. Bowling,...