2474 search results - page 71 / 495 » Solving Problems on Parallel Computers by Cellular Programmi... |
166
click to vote
CP
2005
Springer
15 years 8 months ago
2005
Springer
We combine mixed integer linear programming (MILP) and constraint programming (CP) to minimize tardiness in planning and scheduling. Tasks are allocated to facilities using MILP an...
126
Voted
AISC
2008
Springer
15 years 4 months ago
2008
Springer
Grid computing offers a promising approach to solving challenging computational problems in an environment consisting of a large number of easily accessible resources. In this pape...
117
Voted
TCS
2008
15 years 2 months ago
2008
The longest common subsequence(LCS) problem is one of the classical and wellstudied problems in computer science. The computation of the LCS is a frequent task in DNA sequence ana...
121
click to vote
IPPS
2003
IEEE
15 years 7 months ago
2003
IEEE
Planning is an artificial intelligence problem with a wide range of real-world applications. Genetic algorithms, neural networks, and simulated annealing are heuristic search met...
172
click to vote
CPE
1994
Springer
15 years 6 months ago
1994
Springer
When implementingparallel programs forparallel computer systems the performancescalability of these programs should be tested and analyzed on different computer configurations and...