15485 search results - page 322 / 3097 » Computing Optimal Subsets |
155
click to vote
CEC
2007
IEEE
15 years 10 months ago
2007
IEEE
XCS with Computed Action, briefly XCSCA, is a recent extension of XCS to tackle problems involving a large number of discrete actions. In XCSCA the classifier action is computed wi...
166
click to vote
FOCS
2006
IEEE
16 years 22 days ago
2006
IEEE
In this paper, we use random-selection protocols in the full-information model to solve classical problems in distributed computing. Our main results are the following: • An O(l...
149
click to vote
GECCO
2005
Springer
16 years 6 days ago
2005
Springer
We discuss a number of fundamental areas in which biologically inspired computing has so far failed to mirror biological reality. These failures make it difficult for those who st...
175
click to vote
ICS
2005
Tsinghua U.
16 years 6 days ago
2005
Tsinghua U.
We present a cache oblivious algorithm for stencil computations, which arise for example in finite-difference methods. Our algorithm applies to arbitrary stencils in n-dimension...
183
click to vote
WOSS
2004
ACM
16 years 3 days ago
2004
ACM
This paper describes an online control framework to design self-managing distributed computing systems that continually optimize their performance in response to changing computin...