145 search results - page 20 / 29 » On finding approximate optimal paths in weighted regions |
ICML
2000
IEEE
16 years 18 days ago
2000
IEEE
This paper discusses theoretical and experimental aspects of gradient-based approaches to the direct optimization of policy performance in controlled ??? ?s. We introduce ??? ?, a...
CPAIOR
2009
Springer
15 years 6 months ago
2009
Springer
The interdiction problem arises in a variety of areas including military logistics, infectious disease control, and counter-terrorism. In the typical formulation of network interdi...
118
click to vote
CEC
2008
IEEE
15 years 6 months ago
2008
IEEE
—Ant Colony Optimization (ACO) algorithm is a novel meta-heuristic algorithm for the approximate solution of combinatorial optimization problems that has been inspired by the for...
118
click to vote
AINA
2005
IEEE
15 years 5 months ago
2005
IEEE
A core-based group-shared multicast tree is a shortest path tree rooted at core node that distributes packets to and from all group members. Traditionally, the bandwidth cost cons...
ICCAD
2004
IEEE
15 years 8 months ago
2004
IEEE
Traditional timing-driven placement considers only combinational delays and does not take into account the potential of subsequent sequential optimization steps. As a result, the ...