Sciweavers

5331 search results - page 709 / 1067
» Algebraic Methods for Optimization Problems
Sort
View
IPPS
2006
IEEE
16 years 24 days ago
On the impact of data input sets on statistical compiler tuning
In recent years, several approaches have been proposed to use profile information in compiler optimization. This profile information can be used at the source level to guide loo...
Masayo Haneda, Peter M. W. Knijnenburg, Harry A. G...
AIPS
2010
15 years 9 months ago
Action Elimination and Plan Neighborhood Graph Search: Two Algorithms for Plan Improvement
Compared to optimal planners, satisficing planners can solve much harder problems but may produce overly costly and long plans. Plan quality for satisficing planners has become in...
Hootan Nakhost, Martin Müller 0003
JMLR
2006
124views more  JMLR 2006»
15 years 6 months ago
Policy Gradient in Continuous Time
Policy search is a method for approximately solving an optimal control problem by performing a parametric optimization search in a given class of parameterized policies. In order ...
Rémi Munos
EVOW
2010
Springer
15 years 5 months ago
Finding Gapped Motifs by a Novel Evolutionary Algorithm
Background: Identifying approximately repeated patterns, or motifs, in DNA sequences from a set of co-regulated genes is an important step towards deciphering the complex gene reg...
Chengwei Lei, Jianhua Ruan
ATAL
2008
Springer
15 years 8 months ago
Adaptive Kanerva-based function approximation for multi-agent systems
In this paper, we show how adaptive prototype optimization can be used to improve the performance of function approximation based on Kanerva Coding when solving largescale instanc...
Cheng Wu, Waleed Meleis