3367 search results - page 357 / 674 » Incremental assignment problem |
117
click to vote
AAAI
1994
15 years 6 months ago
1994
It has recently been shown that local search is surprisingly good at nding satisfying assignments for certain computationally hard classes of CNF formulas. The performance of basi...
152
click to vote
AMW
2009
15 years 6 months ago
2009
We investigate if the mapping between text and time series data is feasible such that relevant data mining problems in text can find their counterparts in time series (and vice ver...
152
click to vote
ESA
2010
Springer
15 years 5 months ago
2010
Springer
Abstract. Minimizing the makespan or maximizing the minimum machine load are two of the most important and fundamental parallel machine scheduling problems. In an online scenario, ...
131
click to vote
CORR
2008
Springer
15 years 4 months ago
2008
Springer
: Our research has shown that schedules can be built mimicking a human scheduler by using a set of rules that involve domain knowledge. This chapter presents a Bayesian Optimizatio...
140
click to vote
IJPP
2008
15 years 4 months ago
2008
We present an approach to the analysis and optimisation of heterogeneous multiprocessor embedded systems. The systems are heterogeneous not only in terms of hardware components, b...