Sciweavers

1568 search results - page 272 / 314
» The problem of examination questions in algorithmics
Sort
View
AAAI
1992
15 years 5 months ago
On the Minimality and Decomposability of Constraint Networks
Constraint networks have been shown to be useful in formulating such diverse problems as scene labeling, natural language parsing, and temporal reasoning. Given a constraint netwo...
Peter van Beek
GECCO
2008
Springer
127views Optimization» more  GECCO 2008»
15 years 5 months ago
Social interaction in particle swarm optimization, the ranked FIPS, and adaptive multi-swarms
The interaction among particles is a vital aspect of Particle Swarm Optimization. As such, it has a strong influence on the swarm’s success. In this study various approaches re...
Johannes Jordan, Sabine Helwig, Rolf Wanka
GECCO
2008
Springer
133views Optimization» more  GECCO 2008»
15 years 5 months ago
Using feature-based fitness evaluation in symbolic regression with added noise
Symbolic regression is a popular genetic programming (GP) application. Typically, the fitness function for this task is based on a sum-of-errors, involving the values of the depe...
Janine H. Imada, Brian J. Ross
ICML
2010
IEEE
15 years 5 months ago
OTL: A Framework of Online Transfer Learning
In this paper, we investigate a new machine learning framework called Online Transfer Learning (OTL) that aims to transfer knowledge from some source domain to an online learning ...
Peilin Zhao, Steven C. H. Hoi
CCE
2006
15 years 4 months ago
Parameter estimation in continuous-time dynamic models using principal differential analysis
Principal differential analysis (PDA) is an alternative parameter estimation technique for differential equation models in which basis functions (e.g., B-splines) are fitted to dy...
A. A. Poyton, M. S. Varziri, K. B. McAuley, P. J. ...