Sciweavers

986 search results - page 112 / 198
» Generalized Goal Programming: polynomial methods and applica...
Sort
View
ICML
2009
IEEE
14 years 10 months ago
Learning kernels from indefinite similarities
Similarity measures in many real applications generate indefinite similarity matrices. In this paper, we consider the problem of classification based on such indefinite similariti...
Yihua Chen, Maya R. Gupta, Benjamin Recht
CI
2005
106views more  CI 2005»
13 years 9 months ago
Incremental Learning of Procedural Planning Knowledge in Challenging Environments
Autonomous agents that learn about their environment can be divided into two broad classes. One class of existing learners, reinforcement learners, typically employ weak learning ...
Douglas J. Pearson, John E. Laird
HYBRID
2010
Springer
13 years 11 months ago
Receding horizon control for temporal logic specifications
In this paper, we describe a receding horizon scheme that satisfies a class of linear temporal logic specifications sufficient to describe a wide range of properties including saf...
Tichakorn Wongpiromsarn, Ufuk Topcu, Richard M. Mu...
KDD
2008
ACM
183views Data Mining» more  KDD 2008»
14 years 9 months ago
A bayesian mixture model with linear regression mixing proportions
Classic mixture models assume that the prevalence of the various mixture components is fixed and does not vary over time. This presents problems for applications where the goal is...
Xiuyao Song, Chris Jermaine, Sanjay Ranka, John Gu...
ICCD
1994
IEEE
142views Hardware» more  ICCD 1994»
14 years 1 months ago
Grammar-Based Optimization of Synthesis Scenarios
Systems for multi-level logic optimization are usually based on a set of specialized, loosely-related transformations which work on a network representation. The sequence of trans...
Andreas Kuehlmann, Lukas P. P. P. van Ginneken