Sciweavers

6740 search results - page 99 / 1348
» An s -Hamiltonian Line Graph Problem
Sort
View
4OR
2004
84views more  4OR 2004»
13 years 10 months ago
Non-classical preference models in combinatorial problems: Models and algorithms for graphs
This is a summary of the most important results presented in the author's PhD thesis (Spanjaard, 2003). This thesis, written in French, was defended on 16 December 2003 and su...
Olivier Spanjaard
CVIU
2006
168views more  CVIU 2006»
13 years 10 months ago
Fitting conics to paracatadioptric projections of lines
The paracatadioptric camera is one of the most popular panoramic systems currently available in the market. It provides a wide field of view by combining a parabolic shaped mirror...
João P. Barreto, Helder Araújo
ESA
2008
Springer
134views Algorithms» more  ESA 2008»
13 years 12 months ago
A Near-Tight Bound for the Online Steiner Tree Problem in Graphs of Bounded Asymmetry
The edge asymmetry of a directed, edge-weighted graph is defined as the maximum ratio of the weight of antiparallel edges in the graph, and can be used as a measure of the heterog...
Spyros Angelopoulos
COLING
1994
13 years 11 months ago
Structure Sharing Problem And Its Solution In Graph Unification
The revised graph unification algorithms presented here are more efficient because they reduce the amount of copying that was necessary because of the assumption that data-structu...
Kiyoshi Kogure
GECCO
2003
Springer
116views Optimization» more  GECCO 2003»
14 years 3 months ago
A Hybrid Genetic Algorithm Based on Complete Graph Representation for the Sequential Ordering Problem
Abstract. A hybrid genetic algorithm is proposed for the sequential ordering problem. It is known that the performance of a genetic algorithm depends on the survival environment an...
Dong-il Seo, Byung Ro Moon