15033 search results - page 2643 / 3007 » Complexity Theory and Algorithms |
173
click to vote
ECSQARU
2009
Springer
16 years 1 months ago
2009
Springer
To explore the Perturb and Combine idea for estimating probability densities, we study mixtures of tree structured Markov networks derived by bagging combined with the Chow and Liu...
174
click to vote
FC
2009
Springer
16 years 1 months ago
2009
Springer
We present a cryptographic protocol for conducting efficient, provably correct and secrecy-preserving combinatorial clock-proxy auctions. The “clock phase” functions as a trust...
180
click to vote
FSTTCS
2009
Springer
16 years 1 months ago
2009
Springer
ABSTRACT. We consider concurrent systems that can be modelled as 1-safe Petri nets communicating through a fixed set of buffers (modelled as unbounded places). We identify a param...
180
click to vote
GECCO
2009
Springer
16 years 1 months ago
2009
Springer
Helicopter hovering is an important challenge problem in the field of reinforcement learning. This paper considers several neuroevolutionary approaches to discovering robust cont...
184
click to vote
GECCO
2009
Springer
16 years 1 months ago
2009
Springer
Solving complex, real-world problems with genetic programming (GP) can require extensive computing resources. However, the highly parallel nature of GP facilitates using a large n...