10054 search results - page 388 / 2011 » On the Complexity of Function Learning |
169
click to vote
CONCUR
2004
Springer
16 years 6 days ago
2004
Springer
We define a language whose type system, incorporating session types, allows complex protocols to be specified by types and verified by static typechecking. A session type, asso...
155
click to vote
SPIRE
2004
Springer
16 years 4 days ago
2004
Springer
This paper presents a generalization of the notion of longest repeats with a block of k don’t care symbols introduced by [8] (for k fixed) to longest motifs composed of three pa...
187
click to vote
GLVLSI
2003
IEEE
16 years 3 days ago
2003
IEEE
It is likely that it will become increasingly difficult to manufacture the complex, heterogeneous logic structures that characterise current reconfigurable logic systems. As a res...
195
click to vote
PPSN
1992
Springer
15 years 11 months ago
1992
Springer
In this paper, we describe the application of a new type of genetic algorithm called the Structured Genetic Algorithm (sGA) for function optimization in nonstationary environments...
156
click to vote
CHI
2009
ACM
15 years 10 months ago
2009
ACM
The domestic environment is more than a place where to live. It is a "territory of meaning", a place where pleasure, affect and aesthetics are deeply interwoven with the...