Sciweavers

3874 search results - page 91 / 775
» Approximation Algorithms for k-hurdle Problems
Sort
View
SMC
2010
IEEE
158views Control Systems» more  SMC 2010»
14 years 7 months ago
A study of genetic algorithms for approximating the longest path in generic graphs
Abstract--Finding the longest simple path in a generic undirected graph is a challenging issue that belongs to the NPComplete class of problems. Four approaches based on genetic al...
David Portugal, Carlos Henggeler Antunes, Rui Roch...
MOR
2000
90views more  MOR 2000»
14 years 9 months ago
A PTAS for Minimizing the Total Weighted Completion Time on Identical Parallel Machines
We consider the problem of scheduling a set of n jobs on m identical parallel machines so as to minimize the weighted sum of job completion times. This problem is NP-hard in the s...
Martin Skutella, Gerhard J. Woeginger
DSD
2005
IEEE
123views Hardware» more  DSD 2005»
15 years 3 months ago
Hardware-Based Implementation of the Common Approximate Substring Algorithm
An implementation of an algorithm for string matching, commonly used in DNA string analysis, using configurable technology is proposed. The design of the circuit allows for pipeli...
Kenneth B. Kent, Sharon Van Schaick, Jacqueline E....
ICWS
2009
IEEE
15 years 7 months ago
What are the Problem Makers: Ranking Activities According to their Relevance for Process Changes
Recently, a new generation of adaptive process management technology has emerged, which enables dynamic changes of composite services and process models respectively. This, in tur...
Chen Li, Manfred Reichert, Andreas Wombacher
AMC
2006
115views more  AMC 2006»
14 years 10 months ago
A memetic algorithm for a vehicle routing problem with backhauls
This paper considers an extension of a vehicle routing problem with backhauls (VRPB). In this problem, a set of costumers are divided in two subsets consisting of linehaul and bac...
Reza Tavakkoli-Moghaddam, A. R. Saremi, M. S. Ziae...