Sciweavers

145 search results - page 20 / 29
» On finding approximate optimal paths in weighted regions
Sort
View
ICML
2000
IEEE
14 years 8 months ago
Reinforcement Learning in POMDP's via Direct Gradient Ascent
This paper discusses theoretical and experimental aspects of gradient-based approaches to the direct optimization of policy performance in controlled ??? ?s. We introduce ??? ?, a...
Jonathan Baxter, Peter L. Bartlett
CPAIOR
2009
Springer
14 years 2 months ago
Optimal Interdiction of Unreactive Markovian Evaders
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...
Alexander Gutfraind, Aric A. Hagberg, Feng Pan
CEC
2008
IEEE
14 years 2 months ago
DEACO: Hybrid Ant Colony Optimization with Differential Evolution
—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...
Xiangyin Zhang, Haibin Duan, Jiqiang Jin
AINA
2005
IEEE
14 years 1 months ago
Dynamical Construction of a Core-Based Group-Shared Multicast Tree in Mobile Ad Hoc Networks
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...
Bing-Hong Liu, Ming-Jer Tsai, Wei-Chei Ko
ICCAD
2004
IEEE
180views Hardware» more  ICCAD 2004»
14 years 4 months ago
Physical placement driven by sequential timing analysis
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 ...
Aaron P. Hurst, Philip Chong, Andreas Kuehlmann