6740 search results - page 55 / 1348 » An s -Hamiltonian Line Graph Problem |
103
click to vote
FLAIRS
2006
15 years 4 months ago
2006
The goal of this paper is to propose a tabu search heuristic for the car sequencing problem (CSP) used for the ROADEF 2005 international Challenge. This NP-hard problem was propos...
124
click to vote
ETFA
2008
IEEE
15 years 4 months ago
2008
IEEE
In factory automation, production line scheduling entails a number of competing issues. Finding optimal configurations often requires use of local search techniques. Local search l...
130
click to vote
VAMOS
2007
Springer
15 years 9 months ago
2007
Springer
Using a product line approach allows companies realize significant improvements in time-to-market, cost, productivity, and quality. One fundamental problem in software product lin...
228
click to vote
NC
2011
14 years 5 months ago
2011
In this paper, graph multiset transformation is introduced and studied as a novel type of parallel graph transformation. The basic idea is that graph transformation rules may be ap...
113
click to vote
ICDAR
2005
IEEE
15 years 8 months ago
2005
IEEE
Problem of recovering a writing order from singlestroked handwritten image can be seen as finding the smoothest Euler path in its graph representation. In this paper, a novel appr...