[PDF] Top 20 A path following algorithm for the graph matching problem
Has 10000 "A path following algorithm for the graph matching problem" found on our website. Below are the top 20 most common "A path following algorithm for the graph matching problem".
A path following algorithm for the graph matching problem
... scalable. The price to pay for the scalability is that the solution found is usually only an approximation of the optimal ...algorithms. The first group is composed of methods ... Voir le document complet
28
Kolmogorov and Zabih's Graph Cuts Stereo Matching Algorithm
... of a slanted roughly uniform surface. We assume a = b + 1 and o is the occlusion ...Then the window at the back is semi transparent and the table provides large reflections ... Voir le document complet
33
A new shortest path algorithm to solve the resource-constrained project scheduling problem with routing from a flow solution
... including, for example, the flexible job-shop scheduling problem with transport (Zhang et ...2012b), the job- shop with transport (Knust, 1999; Lacomme et ...2016), the Flexible ... Voir le document complet
16
An auction/sequential shortest path algorithm for the minimum cost network flow problem
... By the theory of the auction/shortest path algorithm, a shortest path in the reduced graph will be found in a finite number of iterations if there exists at lea[r] ... Voir le document complet
20
On the Quadratic Shortest Path Problem
... [10], the authors study different restoration schemes for self-healing ATM ...particular, the authors examine line and end-to-end restoration schemes. In the former, link failures are ... Voir le document complet
13
A Pretty Complete Combinatorial Algorithm for the Threshold Synthesis Problem
... i=1 a i x i ≥ b represents the same function as ...i=1 a i x i ≥ (s, b] any LPB with minimum threshold s and maximum threshold ...constructed the “tree” containing trivial subproblems as ... Voir le document complet
7
Outdoor visual path following experiments
... 11), the closest features were more than 100m away. The CyCab wide track enabled us to examine the lateral error in CyCab’s motion under such ...conditions. The mapping and navigation part of ... Voir le document complet
7
Evaluation of Graph Matching Measures for Documents Retrieval
... compared the performance of four graph matching methods for graph retrieval with different kind of document ...databases. The receiver-operating curve (ROC) is used to measure ... Voir le document complet
10
A linear-space algorithm for distance preserving graph embedding
... helpful for human perception be- cause we can see how close two objects ...require the embedding of a set of ∗ A preliminary version of this work appeared at CCCG 2007 ...by the ... Voir le document complet
25
A Massively Parallel Combinatorial Optimization Algorithm for the Costas Array Problem
... Laboratory for Informatics: 日仏情報学連携研究拠 点）の構成員であるPhilippe Codognet, Florian Richoux, Yves Caniou の連携で，東京大学 情報基盤センターの大規模 HPC Challenge に応募した。この大規模HPC Challenge はFX10の全 系が24時間利用できるというもので，我々の提案は採択されて， Florian Richoux ... Voir le document complet
11
Infeasible path following algorithms for linear complementarity problems
... Unite´ de recherche INRIA Lorraine, Technopoˆle de Nancy-Brabois, Campus scientifique, 615 rue du Jardin Botanique, BP 101, 54600 VILLERS LE`S NANCY Unite´ de recherche INRIA Rennes, Iri[r] ... Voir le document complet
36
On the Fly Algorithm for the Service Composition Problem
... is a new on-the-fly algorithm that searches part of the state ...in the number of services (this is a lower bound, see [9]) we argue that in the average case it is much ... Voir le document complet
7
A new efficient RLF-like algorithm for the vertex coloring problem
... polynomial-time algorithm for approximating χ(G) has an approximation ratio of O(n(log log n) 2 /(log n) 3 ) [10], where n is the number of vertices in ...Metaheuristics for the VCP ... Voir le document complet
17
An exact algorithm for the Partition Coloring Problem
... of the graph in such a way that two adjacent vertices do not share the same color and the total number of colors is ...minimized. The chromatic number of G, denoted by χ(G), is ... Voir le document complet
25
An exact algorithm for the Partition Coloring Problem
... but for each uncolored subset, we select the vertex with smallest {external, color} ...R9.) The scores of the destroy and repair heuristics are updated at each iteration as follows: if ... Voir le document complet
27
Path coordination for multiple mobile robots: a resolution-complete algorithm
... with the Rational Software Corporation, BP 10-31312 Labége Cedex, France (e-mail: ...objects: the method first plans a path among the stationary obstacles and then tunes the ... Voir le document complet
9
An Algorithm for the Real Interval Eigenvalue Problem
... and the length of the interval is greater than ε, then we split the interval into two equal intervals and the algorithm is applied to each of ...from a theoretical point of view ... Voir le document complet
29
Initial-boundary value problem for the heat equation - A stochastic algorithm
... Value Problem for the heat equation is solved by using a new algorithm based on a random walk on heat ...represents a sophisticated generalization of the Walk on ... Voir le document complet
35
A capacity scaling algorithm for the constrained maximum flow problem
... We suggest capacity scaling algorithms that solve both versions of the constrained maximum flow problem in O((m log M) S(n, m)) time, where n is the number of nodes in the netw[r] ... Voir le document complet
22
A linear-time algorithm for the identifying code problem on block graphs
... (e.g. for paths and cycles [5], for stars [8], for complete multipartite graphs [1] and some subclasses of split graphs ...[2]). A linear-time algorithm to determine γ ID (G) if G is ... Voir le document complet
7
Sujets connexes