Sciweavers

1940 search results - page 47 / 388
» Search with Synonyms: Problems and Solutions
Sort
View
BIBE
2007
IEEE
134views Bioinformatics» more  BIBE 2007»
16 years 19 days ago
Bottom-Up Multiple Row Addition Algorithms for the Biclustering-Problem
Abstract—The discovery of locally and significantly correlated subpatterns within a two-dimensional dataset has recently become quite popular and is amongst others addressed by ...
Hyung-Won Koh, Lars Hildebrand
ANOR
2011
117views more  ANOR 2011»
14 years 10 months ago
A simple and effective algorithm for the MaxMin diversity problem
The challenge of maximizing the diversity of a collection of points arises in a variety of settings, including the setting of search methods for hard optimization problems. One ver...
Daniel Cosmin Porumbel, Jin-Kao Hao, Fred Glover
SDM
2009
SIAM
219views Data Mining» more  SDM 2009»
16 years 3 months ago
A Hybrid Data Mining Metaheuristic for the p-Median Problem.
Metaheuristics represent an important class of techniques to solve, approximately, hard combinatorial optimization problems for which the use of exact methods is impractical. In t...
Alexandre Plastino, Erick R. Fonseca, Richard Fuch...
ATMOS
2010
162views Optimization» more  ATMOS 2010»
15 years 4 months ago
Heuristics for the Traveling Repairman Problem with Profits
In the traveling repairman problem with profits, a repairman (also known as the server) visits a subset of nodes in order to collect time-dependent profits. The objective consists...
Thijs Dewilde, Dirk Cattrysse, Sofie Coene, Frits ...
HEURISTICS
2002
108views more  HEURISTICS 2002»
15 years 6 months ago
Cooperative Parallel Tabu Search for Capacitated Network Design
We present a cooperative parallel tabu search method for the fixed charge, capacitated, multicommodity network design problem. Several communication strategies are analyzed and co...
Teodor Gabriel Crainic, Michel Gendreau