Sciweavers

3838 search results - page 298 / 768
» Techniques for Optimization of Net Algorithms
Sort
View
ICASSP
2011
IEEE
14 years 10 months ago
Powerful extensions to CRFS for grapheme to phoneme conversion
Conditional Random Fields (CRFs) have proven to perform well on natural language processing tasks like name transliteration, concept tagging or grapheme-to-phoneme (g2p) conversio...
Stefan Hahn, Patrick Lehnen, Hermann Ney
VLDB
1995
ACM
113views Database» more  VLDB 1995»
15 years 9 months ago
Efficient Incremental Garbage Collection for Client-Server Object Database Systems
We describe an eficient server-based algorithm for garbage collecting object-oriented databases in a client/server environment. The algorithm is incremental and runs concurrently ...
Laurent Amsaleg, Michael J. Franklin, Olivier Grub...
IWINAC
2005
Springer
15 years 11 months ago
The Allele Meta-model - Developing a Common Language for Genetic Algorithms
Abstract. Due to the lot of different Genetic Algorithm variants, encodings, and attacked problems, very little general theory is available to explain the internal functioning of ...
Stefan Wagner 0002, Michael Affenzeller
CEC
2007
IEEE
16 years 15 days ago
Improving hypervolume-based multiobjective evolutionary algorithms by using objective reduction methods
— Hypervolume based multiobjective evolutionary algorithms (MOEA) nowadays seem to be the first choice when handling multiobjective optimization problems with many, i.e., at lea...
Dimo Brockhoff, Eckart Zitzler
GECCO
2005
Springer
108views Optimization» more  GECCO 2005»
15 years 11 months ago
Some theoretical results about the computation time of evolutionary algorithms
This paper focuses on the computation time of evolutionary algorithms. First, some exact expressions of the mean first hitting times of general evolutionary algorithms in finite...
Lixin X. Ding, Jinghu Yu