Sciweavers

2944 search results - page 145 / 589
» On Well Quasi-orders on Languages
Sort
View
GECCO
2008
Springer
132views Optimization» more  GECCO 2008»
15 years 7 months ago
Subheuristic search and scalability in a hyperheuristic
Our previous work has introduced a hyperheuristic (HH) approach based on Genetic Programming (GP). There, GP employs usergiven languages where domain-specific local heuristics ar...
Robert E. Keller, Riccardo Poli
ACTA
2006
74views more  ACTA 2006»
15 years 6 months ago
Linearly bounded infinite graphs
Linearly bounded Turing machines have been mainly studied as acceptors for context-sensitive languages. We define a natural family of canonical infinite automata representing their...
Arnaud Carayol, Antoine Meyer
CORR
2006
Springer
142views Education» more  CORR 2006»
15 years 6 months ago
Exploiting multilingual nomenclatures and language-independent text features as an interlingua for cross-lingual text analysis a
We are proposing a simple, but efficient basic approach for a number of multilingual and cross-lingual language technology applications that are not limited to the usual two or th...
Ralf Steinberger, Bruno Pouliquen, Camelia Ignat
INFORMATICALT
2007
101views more  INFORMATICALT 2007»
15 years 6 months ago
Internationalization of Compilers
Internationalization of compilers and localization of programming languages is not a usual phenomenon yet; however, due to a rapid progress of software and programming technologies...
Valentina Dagiene, Rimgaudas Laucius
COLING
2002
15 years 6 months ago
Extension of Zipf's Law to Words and Phrases
Zipf's law states that the frequency of word tokens in a large corpus of natural language is inversely proportional to the rank. The law is investigated for two languages Eng...
Le Quan Ha, Elvira I. Sicilia-Garcia, Ji Ming, F. ...