Sciweavers

147 search results - page 11 / 30
» Path Planning Through Variational Dynamic Programming
Sort
View
GECCO
2010
Springer
158views Optimization» more  GECCO 2010»
15 years 27 days ago
Efficiently evolving programs through the search for novelty
A significant challenge in genetic programming is premature convergence to local optima, which often prevents evolution from solving problems. This paper introduces to genetic pro...
Joel Lehman, Kenneth O. Stanley
ISCA
2002
IEEE
103views Hardware» more  ISCA 2002»
15 years 2 months ago
Efficient Dynamic Scheduling Through Tag Elimination
An increasingly large portion of scheduler latency is derived from the monolithic content addressable memory (CAM) arrays accessed during instruction wakeup. The performance of th...
Dan Ernst, Todd M. Austin
ATAL
2008
Springer
14 years 11 months ago
A new approach to cooperative pathfinding
In the multi-agent pathfinding problem, groups of agents need to plan paths between their respective start and goal locations in a given environment, usually a two-dimensional map...
M. Renee Jansen, Nathan R. Sturtevant
AIPS
2008
14 years 12 months ago
Stochastic Planning with First Order Decision Diagrams
Dynamic programming algorithms have been successfully applied to propositional stochastic planning problems by using compact representations, in particular algebraic decision diag...
Saket Joshi, Roni Khardon
IOR
2008
109views more  IOR 2008»
14 years 9 months ago
Polynomial-Time Algorithms for Stochastic Uncapacitated Lot-Sizing Problems
In 1958, Wagner and Whitin published a seminal paper on the deterministic uncapacitated lot-sizing problem, a fundamental model that is embedded in many practical production plann...
Yongpei Guan, Andrew J. Miller