1158 search results - page 82 / 232 » Software is discrete mathematics |
GECCO
2009
Springer
14 years 2 months ago
2009
Springer
Given a set of strings S of equal lengths over an alphabet Σ, the closest string problem seeks a string over Σ whose maximum Hamming distance to any of the given strings is as s...
CP
1999
Springer
14 years 2 months ago
1999
Springer
Reformulating constraint satisfaction problems (CSPs) in lower arity is a common procedure when computing consistency. Lower arity CSPs are simpler to treat than high arity CSPs. ...
GECCO
2006
Springer
14 years 1 months ago
2006
Springer
The quadratic multiple knapsack problem extends the quadratic knapsack problem with K knapsacks, each with its own capacity Ck. A greedy heuristic fills the knapsacks one at a tim...
GECCO
2006
Springer
14 years 1 months ago
2006
Springer
Surprisingly, general search heuristics often solve combinatorial problems quite sufficiently, although they do not outperform specialized algorithms. Here, the behavior of simple...
PDPTA
2000
13 years 11 months ago
2000
When evaluating quantitative aspects of communication networks using simulation, one of the main difficulties to face is the often considerable computing power required. In some s...