92 search results - page 17 / 19 » Evolving heuristically difficult instances of combinatorial ... |
SIGIR
2008
ACM
14 years 9 months ago
2008
ACM
It is difficult to apply machine learning to new domains because often we lack labeled problem instances. In this paper, we provide a solution to this problem that leverages domai...
DAC
2007
ACM
15 years 10 months ago
2007
ACM
We consider the problem of optimizing the performance of a latency-insensitive system (LIS) where the addition of backpressure has caused throughput degradation. Previous works ha...
SCM
2003
14 years 11 months ago
2003
Individual organisations as well as industry consortia are currently defining application and domain-specific languages using the eXtended Markup Language (XML) standard of the W...
JPDC
2006
14 years 9 months ago
2006
We present provably efficient parallel algorithms for sweep scheduling, which is a commonly used technique in Radiation Transport problems, and involves inverting an operator by i...
COR
2010
14 years 9 months ago
2010
In this paper we propose a new hybrid heuristic for solving 0-1 mixed integer programs based on the principle of variable neighbourhood decomposition search. It combines variable ...