Sciweavers

16404 search results - page 161 / 3281
» A set coverage problem
Sort
View
SOICT
2010
14 years 10 months ago
Constraint-based local search for solving non-simple paths problems on graphs: application to the routing for network covering p
Routing problems have been considered as central problems in the fields of transportation, distribution and logistics. LS(Graph) is a generic framework allowing to model and solve...
Pham Quang Dung, Phan-Thuan Do, Yves Deville, Tuon...
GECCO
2005
Springer
158views Optimization» more  GECCO 2005»
15 years 9 months ago
A genetic algorithm approach to the selection of near-optimal subsets from large sets
The problem attempted in this paper is to select a sample from a large set where the sample is required to have a particular average property. The problem can be expressed as an o...
P. Whiting, P. W. Poon, J. N. Carter
ESEM
2007
ACM
15 years 7 months ago
A Critical Analysis of Empirical Research in Software Testing
In the foreseeable future, software testing will remain one of the best tools we have at our disposal to ensure software dependability. Empirical studies are crucial to software t...
Lionel C. Briand
124
Voted
WDAG
2010
Springer
185views Algorithms» more  WDAG 2010»
15 years 1 months ago
Leader Election Problem versus Pattern Formation Problem
Leader election and arbitrary pattern formation are fundammental tasks for a set of autonomous mobile robots. The former consists in distinguishing a unique robot, called the lead...
Yoann Dieudonné, Franck Petit, Vincent Vill...
BIBE
2007
IEEE
174views Bioinformatics» more  BIBE 2007»
15 years 9 months ago
Shortest Path Approaches for the Longest Common Subsequence of a Set of Strings
—We investigate the k-LCS problem that is finding a longest common subsequence (LCS) for k given input strings. The problem is known to have practical solutions for k = 2, but f...
Marina Barsky, Ulrike Stege, Alex Thomo, Chris Upt...