Sciweavers

133 search results - page 21 / 27
» Task Parallelism for Object Oriented Programs
Sort
View
88
Voted
CP
2004
Springer
15 years 5 months ago
A Hybrid Method for Planning and Scheduling
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...
John N. Hooker
96
Voted
IOR
2007
106views more  IOR 2007»
14 years 11 months ago
Planning and Scheduling by Logic-Based Benders Decomposition
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...
John N. Hooker
ICDCS
1997
IEEE
15 years 3 months ago
Predictable Network Computing
Clusters of networked, off-the-shelf workstations are currently used for computationintensive, parallel applications. However, it is hardly possible to predict the timing behaviou...
Andreas Polze, Gerhard Fohler, Matthias Werner
VL
2008
IEEE
171views Visual Languages» more  VL 2008»
15 years 6 months ago
Usability challenges for enterprise service-oriented architecture APIs
An important part of many programming tasks is the use of libraries and other forms of Application Programming Interfaces (APIs). Programming via web services using a Service-Orie...
Jack Beaton, Sae Young Jeong, Yingyu Xie, Jeffrey ...
143
Voted
CP
2005
Springer
15 years 5 months ago
Planning and Scheduling to Minimize Tardiness
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...
John N. Hooker