1277 search results - page 96 / 256 » Terminating Decision Algorithms Optimally |
132
click to vote
ADHOCNETS
2009
Springer
15 years 10 months 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...
130
click to vote
AI
2006
Springer
15 years 3 months ago
2006
Springer
Branch-and-bound and branch-and-cut use search trees to identify optimal solutions to combinatorial optimization problems. In this paper, we introduce an iterative search strategy...
139
Voted
SIAMDM
2010
14 years 10 months ago
2010
We consider the following network design problem. We are given an undirected network with costs on the edges, a set of terminals, and an upper bound for each terminal limiting the ...
110
click to vote
COCOON
2007
Springer
15 years 9 months ago
2007
Springer
Greedy algorithms are simple, but their relative power is not well understood. The priority framework [5] captures a key notion of “greediness” in the sense that it processes (...
161
Voted
ISAAC
2010
Springer
15 years 1 months ago
2010
Springer
Howard's policy iteration algorithm is one of the most widely used algorithms for finding optimal policies for controlling Markov Decision Processes (MDPs). When applied to we...