3946 search results - page 24 / 790 » The computational complexity of choice sets |
RT
1998
Springer
15 years 4 months ago
1998
Springer
Abstract. There has been great success in speeding up global illumination computation in diffuse environments. The concept of clustering allows radiosity computations even for scen...
NIPS
1998
15 years 1 months ago
1998
The kernel-parameter is one of the few tunable parameters in Support Vector machines, controlling the complexity of the resulting hypothesis. Its choice amounts to model selection...
159
click to vote
JPDC
2007
14 years 11 months ago
2007
High-dimensional problems arising from robot motion planning, biology, data mining, and geographic information systems often require the computation of k nearest neighbor (knn) gr...
CORR
1999
Springer
14 years 11 months ago
1999
Springer
It is known that for any class C closed under union and intersection, the Boolean closure of C, the Boolean hierarchy over C, and the symmetric difference hierarchy over C all are ...
100
click to vote
IJCAI
2003
15 years 1 months ago
2003
The problem of deriving joint policies for a group of agents that maximize some joint reward function can be modeled as a decentralized partially observable Markov decision proces...