Sciweavers

1800 search results - page 21 / 360
» Learning Restart Strategies
Sort
View
COLT
2001
Springer
14 years 1 days ago
On the Synthesis of Strategies Identifying Recursive Functions
A classical learning problem in Inductive Inference consists of identifying each function of a given class of recursive functions from a finite number of its output values. Unifor...
Sandra Zilles
PRICAI
2004
Springer
14 years 27 days ago
Solving Over-Constrained Temporal Reasoning Problems Using Local Search
Temporal reasoning is an important task in many areas of computer science including planning, scheduling, temporal databases and instruction optimisation for compilers. Given a kno...
Matthew Beaumont, John Thornton, Abdul Sattar, Mic...
CEC
2010
IEEE
13 years 6 months ago
Gaussian Adaptation as a unifying framework for continuous black-box optimization and adaptive Monte Carlo sampling
Abstract— We present a unifying framework for continuous optimization and sampling. This framework is based on Gaussian Adaptation (GaA), a search heuristic developed in the late...
Christian L. Müller, Ivo F. Sbalzarini
ML
2010
ACM
141views Machine Learning» more  ML 2010»
13 years 6 months ago
Relational retrieval using a combination of path-constrained random walks
Scientific literature with rich metadata can be represented as a labeled directed graph. This graph representation enables a number of scientific tasks such as ad hoc retrieval o...
Ni Lao, William W. Cohen
IUI
2005
ACM
14 years 1 months ago
Adaptive teaching strategy for online learning
Finding the optimal teaching strategy for an individual student is difficult even for an experienced teacher. Identifying and incorporating multiple optimal teaching strategies fo...
Jungsoon P. Yoo, Cen Li, Chrisila C. Pettey