10148 search results - page 268 / 2030 » Optimal sub-graphical models |
132
Voted
ESA
1995
Springer
15 years 8 months ago
1995
Springer
We present an algorithm that minimizes the expected cost of indirect binary search for data with non-constant access costs, such as disk data. Indirect binary search means that sor...
135
click to vote
AAAI
2010
15 years 6 months ago
2010
It is well known that there cannot be a single "best" heuristic for optimal planning in general. One way of overcoming this is by combining admissible heuristics (e.g. b...
159
Voted
IM
2007
15 years 6 months ago
2007
— Change management is one of the most critical processes in IT management. Some of the reasons are the sheer number of changes and the difficulty of evaluating the impact of cha...
149
click to vote
NIPS
2008
15 years 6 months ago
2008
Uncertainty is omnipresent when we perceive or interact with our environment, and the Bayesian framework provides computational methods for dealing with it. Mathematical models fo...
151
click to vote
CEC
2010
IEEE
15 years 6 months ago
2010
IEEE
Abstract-- Recently, the research on quantum-inspired evolutionary algorithms (QEA) has attracted some attention in the area of evolutionary computation. QEA use a probabilistic re...