2474 search results - page 46 / 495 » Solving Problems on Parallel Computers by Cellular Programmi... |
105
click to vote
PPSN
1998
Springer
15 years 6 months ago
1998
Springer
Many optimization problems require the satisfaction of constraints in addition to their objectives. When using an evolutionary algorithm to solve such problems, these constraints c...
SIGCSE
2000
ACM
15 years 6 months ago
2000
ACM
We describe the experience of three undergraduate computer science programs offering courses on parallel computing. In particular, we offer three different solutions to the proble...
109
click to vote
JGO
2008
15 years 1 months ago
2008
Two-stage stochastic mixed-integer programming (SMIP) problems with recourse are generally difficult to solve. This paper presents a first computational study of a disjunctive cut...
106
click to vote
IPPS
2003
IEEE
15 years 7 months ago
2003
IEEE
Given two strings and of lengths Ñ and Ò, respectively, the all-substrings longest common subsequence (ALCS) problem obtains the lengths of the subsequences common to and any su...
133
click to vote
PPSN
2004
Springer
15 years 7 months ago
2004
Springer
Abstract. This paper introduces a generator that creates problem instances for the Euclidean symmetric travelling salesman problem. To fit real world problems, we look at maps con...