497 search results - page 42 / 100 » On combinations of local theory extensions |
138
click to vote
AIMSA
2008
Springer
15 years 3 months ago
2008
Springer
We present a hybrid approach to Distributed Constraint Satisfaction which combines incomplete, fast, penalty-based local search with complete, slower systematic search. Thus, we pr...
104
click to vote
ESANN
2007
15 years 3 months ago
2007
Mixtures of probabilistic principal component analyzers model high-dimensional nonlinear data by combining local linear models. Each mixture component is specifically designed to...
128
click to vote
ICPR
2006
IEEE
16 years 3 months ago
2006
IEEE
1 A kernel determines the inductive bias of a learning algorithm on a specific data set, and it is beneficial to design specific kernel for a given data set. In this work, we propo...
132
click to vote
LATA
2009
Springer
15 years 8 months ago
2009
Springer
This tutorial will present an overview of the use of Monadic Second-Order Logic to describe sets of finite graphs and graph transformations, in relation with the notions of tree-w...
109
click to vote
TLCA
2009
Springer
15 years 8 months ago
2009
Springer
Abstract. Programming languages theory is full of problems that reduce to proving the consistency of a logic, such as the normalization of typed lambda-calculi, the decidability of...