2905 search results - page 382 / 581 » Formal Memetic Algorithms |
163
click to vote
ICTAI
2009
IEEE
15 years 10 months ago
2009
IEEE
Knowledge constantly grows in scientific discourse and is revised over time by domain experts. The body of knowledge will get structured and refined as the Communities of Practice...
134
click to vote
IEEESCC
2009
IEEE
15 years 10 months ago
2009
IEEE
In many applications involving composite Web services, one or more component services may become unavailable. This presents us with the problem of identifying other components tha...
120
click to vote
FCT
2009
Springer
15 years 10 months ago
2009
Springer
The n-ary first and second recursion theorems formalize two distinct, yet similar, notions of self-reference. Roughly, the n-ary first recursion theorem says that, for any n algo...
135
click to vote
ISAAC
2009
Springer
15 years 10 months ago
2009
Springer
We study the following question, communicated to us by Mikl´os Ajtai: Can all explicit (e.g., polynomial time computable) functions f : ({0, 1}w )3 → {0, 1}w be computed by word...
130
click to vote
ISMIS
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. Several algorithms, namely CubeMiner, Trias, and DataPeeler, have been recently proposed to mine closed patterns in ternary relations. We consider here the specific cont...