14649 search results - page 436 / 2930 » Principles of problem solving |
229
click to vote
WEA
2010
Springer
15 years 12 months ago
2010
Springer
We investigate how the recently developed different approaches to generate randomized roundings satisfying disjoint cardinality constraints behave when used in two classical algori...
181
click to vote
GECCO
2009
Springer
15 years 11 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...
155
click to vote
FOCS
1998
IEEE
15 years 11 months ago
1998
IEEE
In the Finite Capacity Dial-a-Ride problem the input is a metric space, a set of objects {di}, each specifying a source si and a destination ti, and an integer k--the capacity of t...
215
click to vote
IPPS
1998
IEEE
15 years 11 months ago
1998
IEEE
Parallel genetic algorithms (PGAs) have been developed to reduce the large execution times that are associated with serial genetic algorithms (SGAs). They have also been used to s...
197
click to vote
PRICAI
1998
Springer
15 years 11 months ago
1998
Springer
Many real-world constraint satisfaction problems (CSPs) can be over-constrained but contain a set of mandatory or hard constraints that have to be satisfied for a solution to be ac...