2474 search results - page 106 / 495 » Solving Problems on Parallel Computers by Cellular Programmi... |
148
click to vote
IOR
2007
15 years 4 months ago
2007
We combine mixed integer linear programming (MILP) and constraint programming (CP) to solve an important class of planning and scheduling problems. Tasks are allocated to faciliti...
171
click to vote
CLOUDCOM
2010
Springer
15 years 2 months ago
2010
Springer
Inspired by Darwinian evolution, a genetic algorithm (GA) approach is one of the popular heuristic methods for solving hard problems, such as the Job Shop Scheduling Problem (JSSP...
IPPS
2003
IEEE
15 years 10 months ago
2003
IEEE
We present in this work a wide spectrum of results on analyzing the behavior of parallel heuristics for solving optimization problems. We focus on evolutionary algorithms as well ...
196
click to vote
HPDC
1999
IEEE
15 years 9 months ago
1999
IEEE
We are developing a system for collaborative research and development for a distributed group of researchers at different institutions around the world. In a new paradigm for coll...
133
click to vote
ICML
2008
IEEE
16 years 5 months ago
2008
IEEE
The problem of obtaining the maximum a posteriori (map) estimate of a discrete random field is of fundamental importance in many areas of Computer Science. In this work, we build ...