Sciweavers

2657 search results - page 92 / 532
» On the complexity of hierarchical problem solving
Sort
View
ISAAC
1995
Springer
135views Algorithms» more  ISAAC 1995»
15 years 5 months ago
The I/O - Complexity of Ordered Binary - Decision Diagram Manipulation
Ordered Binary-Decision Diagrams (OBDD) are the state-of-the-art data structure for boolean function manipulation and there exist several software packages for OBDD manipulation. ...
Lars Arge
ICASSP
2007
IEEE
15 years 7 months ago
Oversampled Inverse Complex Lapped Transform Optimization
When an oversampled FIR filter bank structure is used for signal analysis, a main problem is to guarantee its invertibility and to be able to determine an inverse synthesis filt...
Jérôme Gauthier, Laurent Duval, Jean-...
ATAL
2000
Springer
15 years 5 months ago
Performance of Coordinating Concurrent Hierarchical Planning Agents Using Summary Information
Abstract. Recent research has provided methods for coordinating the individually formed concurrent hierarchical plans (CHiPs) of a group of agents in a shared environment. A reason...
Bradley J. Clement, Edmund H. Durfee
DAC
2005
ACM
15 years 3 months ago
Power grid simulation via efficient sampling-based sensitivity analysis and hierarchical symbolic relaxation
On-chip supply networks are playing an increasingly important role for modern nanometer-scale designs. However, the ever growing sizes of power grids make the analysis problem ext...
Peng Li
NIPS
2007
15 years 3 months ago
Hierarchical Apprenticeship Learning with Application to Quadruped Locomotion
We consider apprenticeship learning—learning from expert demonstrations—in the setting of large, complex domains. Past work in apprenticeship learning requires that the expert...
J. Zico Kolter, Pieter Abbeel, Andrew Y. Ng