373 search results - page 55 / 75 » An ACO Algorithm for the Most Probable Explanation Problem |
ECML
2007
Springer
14 years 2 months ago
2007
Springer
In this paper we study the identification of sparse interaction networks as a machine learning problem. Sparsity means that we are provided with a small data set and a high number...
GECCO
2005
Springer
14 years 1 months ago
2005
Springer
Tournament selection is the most frequently used form of selection in genetic programming (GP). Tournament selection chooses individuals uniformly at random from the population. A...
CIAC
1994
Springer
14 years 2 days ago
1994
Springer
We consider the problem of maintaining a binary search tree (BST) that minimizes the average access cost needed to satisfy randomly generated requests. We analyze scenarios in whi...
NETWORKING
2008
13 years 9 months ago
2008
In content networks, a replication group refers to a set of nodes that cooperate with each other to retrieve information objects from a distant server. Each node locally replicates...
TSMC
2008
13 years 7 months ago
2008
This correspondence presents an approach to the detection and isolation of component failures in large-scale systems. In the case of sensors that report at rates of 1 Hz or less, t...