442 search results - page 46 / 89 » Discovering Heuristic Strategy for Solving Scheduling Proble... |
104
click to vote
COR
2007
15 years 3 months ago
2007
Minimizing Waiting Time Variance (WTV) is a job scheduling problem where we schedule a batch of n jobs, for servicing on a single resource, in such a way that the variance of thei...
158
Voted
AMAI
2004
Springer
15 years 9 months ago
2004
Springer
This paper presents new look-ahead schemes for backtracking search when solving constraint satisfaction problems. The look-ahead schemes compute a heuristic for value ordering and...
115
click to vote
ICCAD
2003
IEEE
16 years 18 days ago
2003
IEEE
Heuristics are widely used for solving computational intractable synthesis problems. However, until now, there has been limited effort to systematically develop heuristics that ca...
144
Voted
KDD
2007
ACM
16 years 4 months ago
2007
ACM
We present DL8, an exact algorithm for finding a decision tree that optimizes a ranking function under size, depth, accuracy and leaf constraints. Because the discovery of optimal...
135
click to vote
IPPS
1997
IEEE
15 years 8 months ago
1997
IEEE
The n-dimensional grid is one of the most representative patterns of data flow in parallel computation. The most frequently used scheduling models for grids is the unit execution ...