1056 search results - page 149 / 212 » ijcai 2007 |
204
click to vote
IJCAI
2001
15 years 7 months ago
2001
For many supervised learning tasks it is very costly to produce training data with class labels. Active learning acquires data incrementally, at each stage using the model learned...
149
click to vote
IJCAI
2001
15 years 7 months ago
2001
Combinatorial auctions where bidders can bid on bundles of items can lead to more economical allocations, but determining the winners is NP-complete and inapproximable. We present...
158
click to vote
IJCAI
2001
15 years 7 months ago
2001
Boolean linear programs (BLPs) are ubiquitous in AI. Satisfiability testing, planning with resource constraints, and winner determination in combinatorial auctions are all example...
154
click to vote
IJCAI
2001
15 years 7 months ago
2001
We consider an on-line decision-theoretic interpreter and incremental execution of Golog programs. This new interpreter is intended to overcome some limitations of the off-line in...
196
click to vote
IJCAI
2001
15 years 7 months ago
2001
Supervised and unsupervised learning methods have traditionally focused on data consisting of independent instances of a single type. However, many real-world domains are best des...