Sciweavers

1464 search results - page 185 / 293
» Behavioral optimization using the manipulation of timing con...
Sort
View
CP
2004
Springer
14 years 2 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
WADS
2005
Springer
132views Algorithms» more  WADS 2005»
14 years 2 months ago
k-Link Shortest Paths in Weighted Subdivisions
We study the shortest path problem in weighted polygonal subdivisions of the plane, with the additional constraint of an upper bound, k, on the number of links (segments) in the pa...
Ovidiu Daescu, Joseph S. B. Mitchell, Simeon C. Nt...
CISS
2007
IEEE
14 years 3 months ago
Detecting Information Flows: Improving Chaff Tolerance by Joint Detection
— The problem of detecting encrypted information flows using timing information is considered. An information flow consists of both information-carrying packets and irrelevant ...
Ting He, Lang Tong
PDP
2003
IEEE
14 years 2 months ago
Scheduling strategies for mixed data and task parallelism on heterogeneous clusters and grids
We consider the execution of a complex application on a heterogeneous "grid" computing platform. The complex application consists of a suite of identical, independent pr...
Olivier Beaumont, Arnaud Legrand, Yves Robert
CPAIOR
2009
Springer
13 years 10 months ago
Max Energy Filtering Algorithm for Discrete Cumulative Resources
Abstract. In scheduling using constraint programming we usually reason only about possible start times and end times of activities and remove those which are recognized as unfeasib...
Petr Vilím