3874 search results - page 612 / 775 » Approximation Algorithms for k-hurdle Problems |
138
click to vote
AAAI
2004
15 years 5 months ago
2004
Recent algorithms provide powerful solutions to the problem of determining cost-minimizing (or revenue-maximizing) allocations of items in combinatorial auctions. However, in many...
134
click to vote
UAI
2004
15 years 5 months ago
2004
Mixtures of truncated exponentials (MTE) potentials are an alternative to discretization for representing continuous chance variables in influence diagrams. Also, MTE potentials c...
123
click to vote
WSC
2004
15 years 5 months ago
2004
Existing research has defined a new type of simulation time called Approximate Time, where the simulation's knowledge about the values that represent time is uncertain. The a...
126
click to vote
AAAI
1990
15 years 5 months ago
1990
This paper concerns the task of removing redundant information from a given knowledge base, and restructuring it in the form of a tree, so as to admit efficient problem solving ro...
131
click to vote
ICML
2010
IEEE
15 years 5 months ago
2010
IEEE
This paper formalizes Feature Selection as a Reinforcement Learning problem, leading to a provably optimal though intractable selection policy. As a second contribution, this pape...