2790 search results - page 131 / 558 » A generative theory of relevance |
268
click to vote
Lab
Our research is motivated by a strong conviction that business processes in electronic enterprises can be designed to deliver high levels of performance through the use of mathemat...
129
click to vote
CIE
2007
Springer
16 years 20 days ago
2007
Springer
We introduce the notion of a locally computable structure, a natural way of generalizing the notions of computable model theory to uncountable structures S by presenting the finit...
149
click to vote
FCT
2007
Springer
16 years 20 days ago
2007
Springer
We consider standard algorithms of finite graph theory, like for instance shortest path algorithms. We present two general methods to polynomially extend these algorithms to infi...
169
click to vote
GECCO
2000
Springer
15 years 10 months ago
2000
Springer
This paper extends recent results in the GP schema theory by formulating a proper exact schema theorem for GP with one-point crossover. This gives an exact expression for the expe...
173
click to vote
CADE
2008
Springer
15 years 8 months ago
2008
Springer
Completion is a general paradigm for applying inferences to generate a canonical presentation of a logical theory, or to semi-decide the validity of theorems, or to answer queries....