2905 search results - page 336 / 581 » Formal Memetic Algorithms |
131
click to vote
IJCAI
2003
15 years 5 months ago
2003
Information extraction from HTML pages has been conventionally treated as plain text documents extended with HTML tags. However, the growing maturity and correct usage of HTML/XHT...
108
click to vote
ACL
1998
15 years 5 months ago
1998
Word graphs are able to represent a large number of different utterance hypotheses in a very compact manner. However, usually they contain a huge amount of redundancy in terms of ...
128
click to vote
ACL
1997
15 years 5 months ago
1997
Valiant showed that Boolean matrix multiplication (BMM) can be used for CFG parsing. We prove a dual result: CFG parsers running in time O([Gl[w[3-e) on a grammar G and a string w...
126
click to vote
AAAI
1994
15 years 5 months ago
1994
Predicting the behavior of physical systems is essential to both common sense and engineering tasks. It is made especially challenging by the lack of complete precise knowledge of...
119
click to vote
AAAI
1996
15 years 5 months ago
1996
We formalize a model for supervised learning of action strategies in dynamic stochastic domains and show that PAC-learning results on Occam algorithms hold in this model as well. W...