6894 search results - page 379 / 1379 » Generation Problems |
145
click to vote
ITS
2004
Springer
16 years 5 days ago
2004
Springer
Abstract. Hints are an important ingredient of natural language tutorial dialogues. Existing models of hints, however, are limited in capturing their various underlying functions, ...
161
click to vote
ADMA
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. Most of the work in Machine Learning assume that examples are generated at random according to some stationary probability distribution. In this work we study the problem...
163
click to vote
AAAI
2010
15 years 4 months ago
2010
Different solvers for computationally difficult problems such as satisfiability (SAT) perform best on different instances. Algorithm portfolios exploit this phenomenon by predicti...
149
Voted
ICALP
2005
Springer
16 years 10 days ago
2005
Springer
We consider the problem of testing the commutativity of a black-box group specified by its k generators. The complexity (in terms of k) of this problem was first considered by Pa...
196
click to vote
ATAL
2008
Springer
15 years 8 months ago
2008
Springer
Mixed multi-unit combinatorial auctions are combinatorial auctions in which the auctioneer and the bidders negotiate over transformations rather than over simple goods. By proposi...