908 search results - page 38 / 182 » Heuristic Methods for Solving Job-Shop Scheduling Problems |
134
click to vote
ANTS
2000
Springer
15 years 6 months ago
2000
Springer
Abstract. Essentially all subexponential time algorithms for the discrete logarithm problem over nite elds are based on the index calculus idea. In proposing cryptosystems based on...
100
click to vote
DAC
1995
ACM
15 years 5 months ago
1995
ACM
—We address the problem of code optimization for embedded DSP microprocessors. Such processors (e.g., those in the TMS320 series) have highly irregular datapaths, and conventiona...
127
click to vote
CPAIOR
2008
Springer
15 years 3 months ago
2008
Springer
Theoretical models for the evaluation of quickly improving search strategies, like limited discrepancy search, are based on specific assumptions regarding the probability that a va...
106
click to vote
CP
2004
Springer
15 years 7 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...
108
click to vote
CSC
2006
15 years 3 months ago
2006
The computation of radiative effects by the Photon Monte Carlo method is computationally demanding, especially when complex, nongray absorption models are employed. To solve such c...