2796 search results - page 484 / 560 » The coolest path problem |
145
click to vote
UAI
2003
15 years 6 months ago
2003
Precision achieved by stochastic sampling algorithms for Bayesian networks typically deteriorates in face of extremely unlikely evidence. To address this problem, we propose the E...
161
click to vote
NETWORKING
2000
15 years 6 months ago
2000
Abstract. The design of survivable mesh based STM networks has received considerable attention in recent years and is a complex multiconstraint optimization problem. In this paper,...
125
Voted
IJCAI
1997
15 years 6 months ago
1997
Most research in learning for planning has concentrated on efficiency gains. Another important goal is improving the quality of final plans. Learning to improve plan quality has b...
150
click to vote
NIPS
1997
15 years 6 months ago
1997
Nonlinear dimensionality reduction is formulated here as the problem of trying to find a Euclidean feature-space embedding of a set of observations that preserves as closely as p...
177
Voted
CCCG
2009
15 years 6 months ago
2009
In this paper we study the problem of computing an upward straight-line embedding of a directed graph G into a point set S, i.e. a planar drawing of G such that each vertex is map...