663 search results - page 124 / 133 » A Parallel Algorithm for Enumerating Combinations |
109
click to vote
SPAA
2004
ACM
15 years 5 months ago
2004
ACM
Given a general graph G, a fundamental problem is to find a spanning tree H that best approximates G by some measure. Often this measure is some combination of the congestion and...
CP
2004
Springer
15 years 5 months ago
2004
Springer
We combine mixed integer linear programming (MILP) and constraint programming (CP) to solve planning and scheduling problems. Tasks are allocated to facilities using MILP and sche...
120
Voted
IPPS
2002
IEEE
15 years 4 months ago
2002
IEEE
Future scalable, high throughput, and high performance applications are likely to execute on platforms constructed by clustering multiple autonomous distributed servers, with reso...
119
click to vote
BPM
2006
Springer
15 years 3 months ago
2006
Springer
Mining, discovering, and integrating process-oriented services has attracted growing attention in the recent year. Workflow precedence graph and workflow block structures are two i...
96
Voted
IOR
2007
14 years 11 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...