1977 search results - page 181 / 396 » The satisfactory partition problem |
193
click to vote
SPDP
1991
IEEE
15 years 10 months ago
1991
IEEE
The parallel genetic algorithm (PGA) is a prototype of a new kind of a distributed algorithm. It is based on a parallel search by individuals all of which have the complete proble...
153
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
In this paper I investigate several offline and online data transfer scheduling problems and propose efficient algorithms and techniques for addressing them. In the offline case, ...
184
click to vote
IOR
2007
15 years 6 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...
154
click to vote
KBS
2007
15 years 6 months ago
2007
Many combinatorial problems can be modelled as Constraint Satisfaction Problems (CSPs). Solving a general CSP is known to be NP-complete, so closure and heuristic search are usual...
157
click to vote
ICDM
2009
IEEE
16 years 1 months ago
2009
IEEE
Recent advances in data clustering concern clustering ensembles and projective clustering methods, each addressing different issues in clustering problems. In this paper, we consi...