6142 search results - page 595 / 1229 » The Complexity of Partition Functions |
267
click to vote
CP
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. Inspired by AND/OR search spaces for graphical models recently introduced, we propose to augment Ordered Decision Diagrams with AND nodes, in order to capture function de...
203
click to vote
ECML
2006
Springer
15 years 10 months ago
2006
Springer
Reinforcement learning in real-world domains suffers from three curses of dimensionality: explosions in state and action spaces, and high stochasticity. We present approaches that ...
163
click to vote
FPL
2006
Springer
15 years 10 months ago
2006
Springer
The complexity exhibited by pervasive systems is constantly increasing. Customer electronics devices provide day to day a larger amount of functionalities. A common approach for g...
202
click to vote
GECCO
2006
Springer
15 years 10 months ago
2006
Springer
Niching techniques play an important role in evolutionary algorithms. Existing niching methods often require userspecified parameters, limiting their usefulness. This paper propos...
208
click to vote
MPC
1995
Springer
15 years 10 months ago
1995
Springer
Abstract. We present a strategy to develop, in a functional setting, correct, e cient and portable Divide-and-Conquer (DC) programs for massively parallel architectures. Starting f...