4255 search results - page 549 / 851 » On Learning Boolean Functions |
171
click to vote
DAGM
2004
Springer
16 years 1 days ago
2004
Springer
We present an approach to discretizing multivariate continuous data while learning the structure of a graphical model. We derive the joint scoring function from the principle of p...
170
click to vote
EUROGP
2003
Springer
15 years 12 months ago
2003
Springer
Finite state transducers (FSTs) are finite state machines that map strings in a source domain into strings in a target domain. While there are many reports in the literature of ev...
183
click to vote
FLAIRS
2007
15 years 9 months ago
2007
Currently, among the fastest approaches to AI task planning we find many forward-chaining heuristic planners, as FF. Most of their good performance comes from the use of domain-i...
141
click to vote
ECAI
2008
Springer
15 years 8 months ago
2008
Springer
Various tasks need to consider preferences in a dynamic way. We start by discussing several possible meanings of preference change, and then focus on the one we think is the most n...
168
click to vote
AAAI
2010
15 years 8 months ago
2010
We present the design and analysis of an approximately incentive-compatible combinatorial auction. In just a single run, the auction is able to extract enough value information fr...