1027 search results - page 154 / 206 » Progress on the Progressive Party Problem |
EUROPAR
2009
Springer
15 years 2 months ago
2009
Springer
One has a large workload that is “divisible” (its constituent work’s granularity can be adjusted arbitrarily) and one has access to p remote computers that can assist in comp...
104
click to vote
ICCAD
1999
IEEE
15 years 2 months ago
1999
IEEE
The minimum rectilinear Steiner tree (RST) problem is one of the fundamental problems in the field of electronic design automation. The problem is NP-hard, and much work has been ...
PLISP
1989
15 years 1 months ago
1989
Speculative computing is a technique to improve the execution time of certain applications by starting some computations before it is known that the computations are required. A s...
NIPS
2007
14 years 11 months ago
2007
This contribution develops a theoretical framework that takes into account the effect of approximate optimization on learning algorithms. The analysis shows distinct tradeoffs for...
CCE
2006
14 years 9 months ago
2006
There has been significant progress in the area of short-term scheduling of batch processes, including the solution of industrial-sized problems, in the last 20 years. The main go...