Sciweavers

388 search results - page 18 / 78
» Improving Exact Algorithms for MAX-2-SAT
Sort
View
JAIR
2007
112views more  JAIR 2007»
13 years 8 months ago
Cutset Sampling for Bayesian Networks
The paper presents a new sampling methodology for Bayesian networks that samples only a subset of variables and applies exact inference to the rest. Cutset sampling is a network s...
Bozhena Bidyuk, Rina Dechter
GECCO
2005
Springer
119views Optimization» more  GECCO 2005»
14 years 2 months ago
Improving GA search reliability using maximal hyper-rectangle analysis
In Genetic algorithms it is not easy to evaluate the confidence level in whether a GA run may have missed a complete area of good points, and whether the global optimum was found....
Chongshan Zhang, Khaled Rasheed
ALGORITHMICA
2004
111views more  ALGORITHMICA 2004»
13 years 8 months ago
Automated Generation of Search Tree Algorithms for Hard Graph Modification Problems
We present a framework for an automated generation of exact search tree algorithms for NP-hard problems. The purpose of our approach is two-fold--rapid development and improved up...
Jens Gramm, Jiong Guo, Falk Hüffner, Rolf Nie...
DSD
2008
IEEE
91views Hardware» more  DSD 2008»
13 years 10 months ago
A New Rounding Algorithm for Variable Latency Division and Square Root Implementations
The aim of this work is to present a method for rounding quadratically converging algorithms that improves their performance. This method is able to reduce significantly the numbe...
D. Piso, Javier D. Bruguera
CORR
2011
Springer
183views Education» more  CORR 2011»
13 years 3 months ago
Mean-Variance Optimization in Markov Decision Processes
We consider finite horizon Markov decision processes under performance measures that involve both the mean and the variance of the cumulative reward. We show that either randomiz...
Shie Mannor, John N. Tsitsiklis