Sciweavers

6740 search results - page 55 / 1348
» An s -Hamiltonian Line Graph Problem
Sort
View
FLAIRS
2006
13 years 9 months ago
Tabu Search for a Car Sequencing Problem
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...
Nicolas Zufferey, Martin Studer, Edward A. Silver
ETFA
2008
IEEE
13 years 9 months ago
Descending Deviation Optimization techniques for scheduling problems
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...
Kevin McCarty, Milos Manic
VAMOS
2007
Springer
14 years 1 months ago
Visualisation of Variability in Software Product Line Engineering
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...
Daren Nestor, Luke O'Malley, Aaron J. Quigley, Ern...
NC
2011
236views Neural Networks» more  NC 2011»
12 years 10 months ago
Graph multiset transformation: a new framework for massively parallel computation inspired by DNA computing
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...
Hans-Jörg Kreowski, Sabine Kuske
ICDAR
2005
IEEE
14 years 1 months ago
A Novel Approach to Recover Writing Order From Single Stroke Offline Handwritten Images
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...
Yu Qiao, Makoto Yasuhara