2588 search results - page 212 / 518 » Applications of Kolmogorov complexity to computable model th... |
175
click to vote
NAACL
2010
15 years 4 months ago
2010
Synchronous tree substitution grammars are a translation model that is used in syntax-based machine translation. They are investigated in a formal setting and compared to a compet...
149
click to vote
ENTCS
2007
15 years 6 months ago
2007
The application scenarios envisioned for ‘global ubiquitous computing’ have unique requirements that are often incompatible with traditional security paradigms. One alternativ...
169
click to vote
GECCO
2009
Springer
16 years 1 months ago
2009
Springer
Many successful applications have proven the potential of Learning Classifier Systems and the XCS classifier system in particular in datamining, reinforcement learning, and func...
197
click to vote
FOCS
1998
IEEE
15 years 11 months ago
1998
IEEE
We examine the number T of queries that a quantum network requires to compute several Boolean functions on f0;1gN in the black-box model. We show that, in the blackbox model, the ...
191
click to vote
TPDS
2008
15 years 6 months ago
2008
Computational Grids potentially offer low cost, readily available, and large-scale high-performance platforms. For the parallel execution of programs, however, computational GRIDs ...