Sciweavers

16093 search results - page 379 / 3219
» On the optimality of the neighbor-joining algorithm
Sort
View
AIPS
2011
14 years 10 months ago
Heuristic Search for Generalized Stochastic Shortest Path MDPs
Research in efficient methods for solving infinite-horizon MDPs has so far concentrated primarily on discounted MDPs and the more general stochastic shortest path problems (SSPs...
Andrey Kolobov, Mausam, Daniel S. Weld, Hector Gef...
CP
2009
Springer
16 years 1 months ago
Exploiting Problem Decomposition in Multi-objective Constraint Optimization
Multi-objective optimization is concerned with problems involving multiple measures of performance which should be optimized simultaneously. In this paper, we extend AND/OR Branch-...
Radu Marinescu
AAIM
2008
Springer
105views Algorithms» more  AAIM 2008»
16 years 1 months ago
Finding Optimal Refueling Policies in Transportation Networks
We study the combinatorial properties of optimal refueling policies, which specify the transportation paths and the refueling operations along the paths to minimize the total trans...
Shieu-Hong Lin
JMLR
2010
163views more  JMLR 2010»
15 years 1 months ago
Dense Message Passing for Sparse Principal Component Analysis
We describe a novel inference algorithm for sparse Bayesian PCA with a zero-norm prior on the model parameters. Bayesian inference is very challenging in probabilistic models of t...
Kevin Sharp, Magnus Rattray
CORR
2011
Springer
184views Education» more  CORR 2011»
15 years 1 months ago
Finding Shortest Path for Developed Cognitive Map Using Medial Axis
— this paper presents an enhancement of the medial axis algorithm to be used for finding the optimal shortest path for developed cognitive map. The cognitive map has been develop...
Hazim A. Farhan, Hussein H. Owaied, Suhaib I. Al-G...