2313 search results - page 360 / 463 » On Heuristic Time Hierarchies |
175
click to vote
GECCO
2005
Springer
15 years 12 months ago
2005
Springer
Genetic Algorithms (GAs) can efficiently produce high quality results for hard combinatorial real world problems such as the Vehicle Routing Problem (VRP). Genetic Vehicle Represe...
153
click to vote
HM
2005
Springer
15 years 12 months ago
2005
Springer
Abstract. The maximum diversity problem (MDP) consists in identifying, in a population, a subset of elements, characterized by a set of attributes, that present the most diverse ch...
168
click to vote
ICALP
2005
Springer
15 years 12 months ago
2005
Springer
Filtering is a standard technique for fast approximate string matching in practice. In filtering, a quick first step is used to rule out almost all positions of a text as possib...
146
click to vote
ICALP
2005
Springer
15 years 12 months ago
2005
Springer
We consider the problem of efficiently designing sets (codes) of equal-length DNA strings (words) that satisfy certain combinatorial constraints. This problem has numerous motivati...
132
click to vote
PAM
2005
Springer
15 years 12 months ago
2005
Springer
Abstract. Communities of interest (COI) have been applied in a variety of environments ranging from characterizing the online buying behavior of individuals to detecting fraud in t...