Sciweavers

2914 search results - page 162 / 583
» Learning and Inference with Constraints
Sort
View
CSCLP
2006
Springer
15 years 10 months ago
Efficient Recognition of Acyclic Clustered Constraint Satisfaction Problems
Abstract. In this paper we present a novel approach to solving Constraint Satisfaction Problems whose constraint graphs are highly clustered and the graph of clusters is close to b...
Igor Razgon, Barry O'Sullivan
ECAI
2006
Springer
15 years 10 months ago
Automatic Generation of Implied Constraints
Abstract. A well-known difficulty with solving Constraint Satisfaction Problems (CSPs) is that, while one formulation of a CSP may enable a solver to solve it quickly, a different ...
John Charnley, Simon Colton, Ian Miguel
ALT
2009
Springer
16 years 3 months ago
Uncountable Automatic Classes and Learning
In this paper we consider uncountable classes recognizable by ω-automata and investigate suitable learning paradigms for them. In particular, the counterparts of explanatory, vac...
Sanjay Jain, Qinglong Luo, Pavel Semukhin, Frank S...
KCAP
2009
ACM
16 years 1 months ago
POIROT: acquiring workflows by combining models learned from interpreted traces
The POIROT project is a four-year effort to develop an architecture that integrates the products of a number of targeted reasoning and learning components to produce executable re...
Mark H. Burstein, Fusun Yaman, Robert Laddaga, Rob...
CONNECTION
2004
92views more  CONNECTION 2004»
15 years 6 months ago
High capacity associative memories and connection constraints
: High capacity associative neural networks can be built from networks of perceptrons, trained using simple perceptron training. Such networks perform much better than those traine...
Neil Davey, Rod Adams