Sciweavers

1332 search results - page 57 / 267
» Combinatorial Algorithms
Sort
View
ICEC
1996
123views more  ICEC 1996»
13 years 10 months ago
Solving Symmetric and Asymmetric TSPs by Ant Colonies
- In this paper we present ACS, a distributed algorithm for the solution of combinatorial optimization problems which was inspired by the observation of real colonies of ants. We a...
Luca Maria Gambardella, Marco Dorigo
CVPR
2004
IEEE
14 years 11 months ago
Efficient Search of Faces from Complex Line Drawings
Single 2D line drawing is a straightforward method to illustrate 3D objects. The faces of an object depicted by a line drawing give very useful information for the reconstruction ...
Jianzhuang Liu, Xiaoou Tang
UAI
2001
13 years 10 months ago
Maximum Likelihood Bounded Tree-Width Markov Networks
We study the problem of projecting a distribution onto (or finding a maximum likelihood distribution among) Markov networks of bounded tree-width. By casting it as the combinatori...
Nathan Srebro
SAGA
2007
Springer
14 years 3 months ago
A VNS Algorithm for Noisy Problems and Its Application to Project Portfolio Analysis
Abstract. Motivated by an application in project portfolio analysis under uncertainty, we develop an algorithm S-VNS for solving stochastic combinatorial optimization (SCO) problem...
Walter J. Gutjahr, Stefan Katzensteiner, Peter Rei...
ICDAR
2003
IEEE
14 years 2 months ago
A Matching Scheme to Enhance Performance Evaluation of Raster-to-Vector Conversion Algorithms
This paper deals with performance evaluation of rasterto-vector conversion algorithms. We briefly review the past work, and focus our attention on a method proposed by Phillips a...
Xavier Hilaire