4342 search results - page 699 / 869 » Improved Algorithms for Optimal Embeddings |
143
Voted
AAAI
2007
15 years 6 months ago
2007
Partially Observable Markov Decision Processes (POMDPs) provide an appropriately rich model for agents operating under partial knowledge of the environment. Since finding an opti...
123
click to vote
DAC
2005
ACM
15 years 5 months ago
2005
ACM
Finding all satisfying assignments of a propositional formula has many applications in the design of hardware and software. An approach to this problem augments a clause-recording...
133
Voted
AAAI
2004
15 years 5 months ago
2004
Oversubscribed scheduling problems require removing or partially satisfying tasks when enough resources are not available. For a particular oversubscribed problem, Air Force Satel...
147
click to vote
IJCAI
2001
15 years 5 months ago
2001
Most formulations of Reinforcement Learning depend on a single reinforcement reward value to guide the search for the optimal policy solution. If observation of this reward is rar...
139
click to vote
UAI
2004
15 years 5 months ago
2004
Generalized belief propagation (GBP) has proven to be a promising technique for approximate inference tasks in AI and machine learning. However, the choice of a good set of cluste...