Sciweavers

489 search results - page 20 / 98
» Towards an Analysis of Local Optimization Algorithms
Sort
View
ICPPW
2002
IEEE
14 years 17 days ago
Near-Optimal Loop Tiling by Means of Cache Miss Equations and Genetic Algorithms
The effectiveness of the memory hierarchy is critical for the performance of current processors. The performance of the memory hierarchy can be improved by means of program transf...
Jaume Abella, Antonio González, Josep Llosa...
ISPD
1998
ACM
89views Hardware» more  ISPD 1998»
13 years 12 months ago
Filling and slotting: analysis and algorithms
In very deep-submicron VLSI, certain manufacturing steps – notably optical exposure, resist development and etch, chemical vapor deposition and chemical-mechanical polishing (CM...
Andrew B. Kahng, Gabriel Robins, Anish Singh, Huij...
SASO
2009
IEEE
14 years 2 months ago
Distributed W-Learning: Multi-Policy Optimization in Self-Organizing Systems
—Large-scale agent-based systems are required to self-optimize towards multiple, potentially conflicting, policies of varying spatial and temporal scope. As a result, not all ag...
Ivana Dusparic, Vinny Cahill
NIPS
2008
13 years 9 months ago
Signal-to-Noise Ratio Analysis of Policy Gradient Algorithms
Policy gradient (PG) reinforcement learning algorithms have strong (local) convergence guarantees, but their learning performance is typically limited by a large variance in the e...
John W. Roberts, Russ Tedrake
DAARC
2009
Springer
268views Algorithms» more  DAARC 2009»
14 years 2 months ago
Binding without Identity: Towards a Unified Semantics for Bound and Exempt Anaphors
Expressions such as English himself are interpreted as locally bound anaphors in certain syntactic environments and are exempt from the binding conditions in others. This article p...
Eric Reuland, Yoad Winter