Sciweavers

2905 search results - page 256 / 581
» Formal Memetic Algorithms
Sort
View
NIPS
2008
15 years 13 days ago
Evaluating probabilities under high-dimensional latent variable models
We present a simple new Monte Carlo algorithm for evaluating probabilities of observations in complex latent variable models, such as Deep Belief Networks. While the method is bas...
Iain Murray, Ruslan Salakhutdinov
NETWORKING
2007
15 years 13 days ago
Delivery Guarantees in Predictable Disruption Tolerant Networks
This article studies disruption tolerant networks (DTNs) where each node knows the probabilistic distribution of contacts with other nodes. It proposes a framework that allows one ...
Jean-Marc François, Guy Leduc
CSREAESA
2004
15 years 13 days ago
Identifying and Evaluating a Generic Set of Superinstructions for Embedded Java Programs
In this paper we present an approach to the optimisation of interpreted Java programs using superinstructions. Unlike existing techniques, we examine the feasibility of identifying...
Diarmuid O'Donoghue, James F. Power
IJCAI
2003
15 years 12 days ago
Modular self-organization for a long-living autonomous agent
The aim of this paper is to provide a sound framework for addressing a difficult problem: the automatic construction of an autonomous agent's modular architecture. We briefly...
Bruno Scherrer
AIPS
1998
15 years 11 days ago
How to Solve It Automatically: Selection Among Problem Solving Methods
The choice of an appropriate problem-solving method, from available methods, is a crucial skill for experts in many areas. We describe a technique for the automatic selection amon...
Eugene Fink