613 search results - page 51 / 123 » The Memory Fragmentation Problem: Solved |
100
Voted
ICML
2008
IEEE
16 years 3 months ago
2008
IEEE
Point processes are difficult to analyze because they provide only a sparse and noisy observation of the intensity function driving the process. Gaussian Processes offer an attrac...
123
click to vote
UAI
2008
15 years 4 months ago
2008
This paper describes a new algorithm to solve the decision making problem in Influence Diagrams based on algorithms for credal networks. Decision nodes are associated to imprecise...
124
click to vote
CORR
2007
Springer
15 years 2 months ago
2007
Springer
We consider the problem of estimating the parameters of a Gaussian or binary distribution in such a way that the resulting undirected graphical model is sparse. Our approach is to...
250
click to vote
Publication
Popular myths that cheaper memory, high-speed links and high-speed processors will solve the problem of congestion in computer networks are shown to be false. A simple definition f...
120
Voted
ICANNGA
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. A new Genetic Programming variant called Liquid State Genetic Programming (LSGP) is proposed in this paper. LSGP is a hybrid method combining a dynamic memory for storing...