2647 search results - page 150 / 530 » Solving Term Inequalities |
147
click to vote
ATAL
2008
Springer
15 years 6 months ago
2008
Springer
Reinforcement Learning research is traditionally devoted to solve single-task problems. Therefore, anytime a new task is faced, learning must be restarted from scratch. Recently, ...
151
click to vote
ATAL
2008
Springer
15 years 6 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...
139
click to vote
DAC
2005
ACM
15 years 6 months ago
2005
ACM
Grid-warping is a recent placement strategy based on a novel physical analogy: rather than move the gates to optimize their location, it elastically deforms a model of the 2-D chi...
102
click to vote
KDD
2010
ACM
15 years 6 months ago
2010
ACM
The fused Lasso penalty enforces sparsity in both the coefficients and their successive differences, which is desirable for applications with features ordered in some meaningful w...
133
click to vote
ECAI
2008
Springer
15 years 6 months ago
2008
Springer
Pattern Databases were a major breakthrough in heuristic search by solving hard combinatorial problems various orders of magnitude faster than state-of-the-art techniques at that ...