96 search results - page 19 / 20 » Approximating the maximum quadratic assignment problem |
ADHOCNETS
2009
Springer
14 years 26 days ago
2009
Springer
Topology control is the problem of assigning powers to the nodes of an ad hoc network so as to create a specified network topology while minimizing the energy consumed by the netw...
SIROCCO
2010
13 years 7 months ago
2010
The problem of grooming is central in studies of optical networks. In graph-theoretic terms, it can be viewed as assigning colors to given paths in a graph, so that at most g (the ...
ICML
1996
IEEE
14 years 7 months ago
1996
IEEE
Some of the most successful recent applications of reinforcement learning have used neural networks and the TD algorithm to learn evaluation functions. In this paper, we examine t...
STOC
2007
ACM
14 years 6 months ago
2007
ACM
Given as input a directed graph on N vertices and a set of source-destination pairs, we study the problem of routing the maximum possible number of source-destination pairs on pat...
IM
2007
13 years 7 months ago
2007
— We consider whether the off-line compilation of a set of Service Level Agreements (SLAs) into low-level management policies can lead to the runtime maximization of the overall ...