3643 search results - page 425 / 729 » Learning Submodular Functions |
186
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...
142
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...
171
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...
166
click to vote
NIPS
2007
15 years 8 months ago
2007
We present a novel linear clustering framework (DIFFRAC) which relies on a linear discriminative cost function and a convex relaxation of a combinatorial optimization problem. The...
166
click to vote
UAI
2008
15 years 8 months ago
2008
We introduce a new type of graphical model called a `cumulative distribution network' (CDN), which expresses a joint cumulative distribution as a product of local functions. ...