Sciweavers

3678 search results - page 44 / 736
» On the Stable Paths Problem
Sort
View
114
Voted
EOR
2008
78views more  EOR 2008»
15 years 3 months ago
Discounted MEAN bound for the optimal searcher path problem with non-uniform travel times
We consider an extension of the optimal searcher path problem (OSP), where a searcher moving through a discretised environment may now need to spend a nonuniform amount of time tr...
Haye Lau, Shoudong Huang, Gamini Dissanayake
156
Voted
NMA
2010
15 years 1 months ago
Metaheuristics for the Asymmetric Hamiltonian Path Problem
One of the most important applications of the Asymmetric Hamiltonian Path Problem is in scheduling. In this paper we describe a variant of this problem, and develop both a mathemat...
João Pedro Pedroso
137
Voted
EMNLP
2011
14 years 3 months ago
Entire Relaxation Path for Maximum Entropy Problems
We discuss and analyze the problem of finding a distribution that minimizes the relative entropy to a prior distribution while satisfying max-norm constraints with respect to an ...
Moshe Dubiner, Yoram Singer
137
Voted
CORR
2008
Springer
126views Education» more  CORR 2008»
15 years 3 months ago
Path following algorithm for the graph matching problem
We propose a convex-concave programming approach for the labeled weighted graph matching problem. The convex-concave programming formulation is obtained by rewriting the weighted ...
Mikhail Zaslavskiy, Francis Bach, Jean-Philippe Ve...
134
Voted
MP
2008
129views more  MP 2008»
15 years 3 months ago
Corrector-predictor methods for monotone linear complementarity problems in a wide neighborhood of the central path
Abstract. Two corrector-predictor interior point algorithms are proposed for solving monotone linear complementarity problems. The algorithms produce a sequence of iterates in the ...
Florian A. Potra