1277 search results - page 46 / 256 » Terminating Decision Algorithms Optimally |
136
click to vote
AMW
2009
15 years 4 months ago
2009
Abstract. The chase procedure, an algorithm proposed 25+ years ago to fix constraint violations in database instances, has been successfully applied in a variety of contexts, such ...
125
click to vote
MP
2006
15 years 3 months ago
2006
Determining if a solution is optimal or near optimal is fundamental in optimization theory, algorithms, and computation. For instance, Karush-Kuhn-Tucker conditions provide necessa...
133
click to vote
CORR
2010
Springer
15 years 1 months ago
2010
Springer
We consider model-based reinforcement learning in finite Markov Decision Processes (MDPs), focussing on so-called optimistic strategies. Optimism is usually implemented by carryin...
130
click to vote
ATVA
2005
Springer
15 years 8 months ago
2005
Springer
Multi-Terminal Binary Decision Diagrams (MTBDDs) have been successfully applied in symbolic model checking of probabilistic systems. In this paper we propose an encoding method for...
100
click to vote
GECCO
2003
Springer
15 years 8 months ago
2003
Springer
Ensuring building-block (BB) mixing is critical to the success of genetic and evolutionary algorithms. This study develops facetwise models to predict the BB mixing time and the po...