230 search results - page 5 / 46 » Experiments with Improved Approximate Mean Value Analysis Al... |
STOC
2010
ACM
14 years 15 days ago
2010
ACM
The Steiner tree problem is one of the most fundamental ÆÈ-hard problems: given a weighted undirected graph and a subset of terminal nodes, find a minimum weight tree spanning ...
STACS
2005
Springer
14 years 1 months ago
2005
Springer
Exponential algorithms, i.e. algorithms of complexity O(cn ) for some c > 1, seem to be unavoidable in the case of NP-complete problems (unless P=NP), especially if the problem ...
ICML
1995
IEEE
14 years 8 months ago
1995
IEEE
A number of reinforcement learning algorithms have been developed that are guaranteed to converge to the optimal solution when used with lookup tables. It is shown, however, that ...
ISAAC
2010
Springer
13 years 5 months ago
2010
Springer
Abstract. Classical list scheduling is a very popular and efficient technique for scheduling jobs in parallel platforms. However, with the increasing number of processors, the cost...
CSCLP
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. In this paper we develop a localized value-ordering heuristic for distributed resource allocation problems. We show how this value ordering heuristics can be used to achi...