14548 search results - page 160 / 2910 » The Optimal Path-Matching Problem |
ICASSP
2011
IEEE
13 years 2 months ago
2011
IEEE
We consider distributed algorithms to optimize random access multihop wireless networks in the presence of fading. Since the associated optimization problem is neither convex nor ...
EMNLP
2011
12 years 10 months ago
2011
We present a simple objective function that when optimized yields accurate solutions to both decipherment and cognate pair identification problems. The objective simultaneously s...
ICC
2011
IEEE
12 years 10 months ago
2011
IEEE
—Ant colony optimization (ACO) is a probabilistic technique used for solving complex computational problems, such as finding optimal routes in networks. It has been proved to pe...
ANOR
2011
13 years 5 months ago
2011
Abstract The problem of finding a global optimum of an unconstrained multimodal function has been the subject of intensive study in recent years, giving rise to valuable advances ...
MICS
2010
13 years 5 months ago
2010
In this paper we consider the k-fixed-endpoint path cover problem on proper interval graphs, which is a generalization of the path cover problem. Given a graph G and a set T of k v...