Sciweavers

2783 search results - page 370 / 557
» The Nature Of Near-Synonymic Relations
Sort
View
CLEF
2007
Springer
15 years 7 months ago
Unsupervised Acquiring of Morphological Paradigms from Tokenized Text
This paper describes a rather simplistic method of unsupervised morphological analysis of words in an unknown language. All what is needed is a raw text corpus in the given langua...
Daniel Zeman
COORDINATION
2007
Springer
15 years 7 months ago
Reactors: A Data-Oriented Synchronous/Asynchronous Programming Model for Distributed Applications
Our aim is to define the kernel of a simple and uniform programming model—the reactor model—suitable for building and evolving internet-scale programs. A reactor consists of t...
John Field, Maria-Cristina V. Marinescu, Christian...
CPAIOR
2007
Springer
15 years 7 months ago
On Boolean Functions Encodable as a Single Linear Pseudo-Boolean Constraint
A linear pseudo-Boolean constraint (LPB) is an expression of the form a1 · 1 + . . . + am · m ≥ d, where each i is a literal (it assumes the value 1 or 0 depending on whether a...
Jan-Georg Smaus
ECAL
2007
Springer
15 years 7 months ago
Spatial Embedding and Complexity: The Small-World Is Not Enough
The “order for free” exhibited by some classes of system has been exploited by natural selection in order to build systems capable of exhibiting complex behaviour. Here we expl...
Christopher L. Buckley, Seth Bullock
GECCO
2007
Springer
160views Optimization» more  GECCO 2007»
15 years 7 months ago
Self-modifying cartesian genetic programming
In nature, systems with enormous numbers of components (i.e. cells) are evolved from a relatively small genotype. It has not yet been demonstrated that artificial evolution is su...
Simon Harding, Julian Francis Miller, Wolfgang Ban...