373 search results - page 9 / 75 » An ACO Algorithm for the Most Probable Explanation Problem |
INFORMS
2008
13 years 7 months ago
2008
Most traditional routing problems assume perfect operability of all arcs and nodes. However, when independent arc failure probabilities exist, a secondary objective must be presen...
ICUMT
2009
13 years 4 months ago
2009
This paper introduces a Combinatory Optimization Problem (COP) which captures the performance in cooperation of a P2P Streaming Network, considered at the buffer level. A new famil...
ICPR
2006
IEEE
14 years 8 months ago
2006
IEEE
In this paper we consider face recognition from sets of face images and, in particular, recognition invariance to illumination. The main contribution is an algorithm based on the ...
GECCO
2007
Springer
13 years 11 months ago
2007
Springer
The Negative Slope Coefficient (nsc) is an empirical measure of problem hardness based on the analysis of offspring-fitness vs. parent-fitness scatterplots. The nsc has been teste...
JAIR
2000
13 years 6 months ago
2000
This paper reviews the connections between Graphplan's planning-graph and the dynamic constraint satisfaction problem and motivates the need for adapting CSP search technique...