Sciweavers

2657 search results - page 7 / 532
» On the complexity of hierarchical problem solving
Sort
View
EUROCAST
2009
Springer
185views Hardware» more  EUROCAST 2009»
15 years 4 months ago
Solving the Euclidean Bounded Diameter Minimum Spanning Tree Problem by Clustering-Based (Meta-)Heuristics
The bounded diameter minimum spanning tree problem is an NP-hard combinatorial optimization problem arising in particular in network design. There exist various exact and metaheuri...
Martin Gruber, Günther R. Raidl
107
Voted
AIPS
2010
14 years 10 months ago
Incrementally Solving STNs by Enforcing Partial Path Consistency
Efficient management and propagation of temporal constraints is important for temporal planning as well as for scheduling. During plan development, new events and temporal constra...
Léon Planken, Mathijs de Weerdt, Neil Yorke...
GECCO
2007
Springer
156views Optimization» more  GECCO 2007»
15 years 3 months ago
Hierarchical genetic programming based on test input subsets
Crucial to the more widespread use of evolutionary computation techniques is the ability to scale up to handle complex problems. In the field of genetic programming, a number of d...
David Jackson
ICML
2003
IEEE
15 years 10 months ago
Hierarchical Policy Gradient Algorithms
Hierarchical reinforcement learning is a general framework which attempts to accelerate policy learning in large domains. On the other hand, policy gradient reinforcement learning...
Mohammad Ghavamzadeh, Sridhar Mahadevan
ASPDAC
1998
ACM
86views Hardware» more  ASPDAC 1998»
15 years 1 months ago
Hierarchy - A CHDStd Tool for the Coming Deep Submicron Complex Design Crisis
Abstract -- This paper describes the use of a hierarchical design representation standard, CHDStd, as part of the architecture of the Chip Hierarchical Design System (CHDS). Detail...
S. Grout, G. Ledenbach, R. G. Bushroe, P. Fisher, ...